./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7923672572112c1e23e765d37ba0d9265e37954a51bbbf4393296aaafd9ce3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:55,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:55,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:55,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:55,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:55,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:55,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:55,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:55,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:55,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:55,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:55,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:55,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:55,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:55,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:55,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:55,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:55,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:55,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:55,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:55,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:55,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:55,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:55,074 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 -> d7923672572112c1e23e765d37ba0d9265e37954a51bbbf4393296aaafd9ce3e [2025-03-03 15:07:55,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:55,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:55,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:55,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:55,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:55,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:07:56,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e581cc/3f22f6fb273a4d5ebd439f980fd11c86/FLAG794327eb1 [2025-03-03 15:07:56,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:56,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:07:56,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e581cc/3f22f6fb273a4d5ebd439f980fd11c86/FLAG794327eb1 [2025-03-03 15:07:57,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e581cc/3f22f6fb273a4d5ebd439f980fd11c86 [2025-03-03 15:07:57,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:57,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:57,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:57,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:57,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:57,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3caa5c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57, skipping insertion in model container [2025-03-03 15:07:57,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:57,277 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9988,10001] [2025-03-03 15:07:57,323 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24517,24530] [2025-03-03 15:07:57,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:57,454 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:57,493 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9988,10001] [2025-03-03 15:07:57,520 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24517,24530] [2025-03-03 15:07:57,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:57,615 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:57,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57 WrapperNode [2025-03-03 15:07:57,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:57,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:57,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:57,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:57,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,712 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3648 [2025-03-03 15:07:57,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:57,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:57,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:57,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:57,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,781 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-03 15:07:57,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:57,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:57,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:57,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:57,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (1/1) ... [2025-03-03 15:07:57,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:57,884 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-03 15:07:57,887 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-03 15:07:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:58,055 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:58,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3999: havoc main_~node4__m4~21#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1688: havoc main_~node4__m4~8#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5718: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4661: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:07:59,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: havoc main_~check__tmp~8#1;havoc main_~node4__m4~5#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~17#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3011: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1756: havoc main_~check__tmp~13#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4994: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3739: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~35#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~node3__m3~1#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4401: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5922: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5196: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:07:59,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2687: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5594: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4670: havoc main_~node4__m4~25#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3415: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4077: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426: havoc main_~node4__m4~12#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2889: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4607: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~45#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3286: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2098: havoc main_~node4__m4~10#1; [2025-03-03 15:07:59,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4279: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~41#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5072: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3619: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1439: havoc main_~node4__m4~6#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5337: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5800: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~59#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4748: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node4__m4~1#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: havoc main_~node4__m4~17#1; [2025-03-03 15:07:59,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc main_~node4__m4~16#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5476: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~55#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5278: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513: havoc main_~check__tmp~10#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2504: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: havoc main_~node4__m4~14#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L457: havoc main_~node2__m2~2#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4487: havoc main_~node4__m4~24#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: havoc main_~node4__m4~3#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4950: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~49#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5347: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2176: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3960: havoc main_~node2__m2~4#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node3__m3~0#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4159: havoc main_~node4__m4~22#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: havoc main_~check__tmp~11#1;havoc main_~node4__m4~7#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5680: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4361: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L861: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5882: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~60#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060: havoc main_~check__tmp~5#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L929: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2647: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5554: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~56#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:07:59,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5356: havoc main_~node4__m4~29#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5158: havoc main_~node4__m4~28#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L798: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3903: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~37#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3970: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4565: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4037: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830: havoc main_~node4__m4~26#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1131: havoc main_~node3__m3~3#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~15#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5758: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5032: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:07:59,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node3__m3~2#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc main_~node3__m3~6#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node4__m4~0#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2262: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3980: havoc main_~node3__m3~8#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~43#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5434: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5236: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3783: havoc main_~node4__m4~20#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4708: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1405: havoc main_~node2__m2~3#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5964: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~61#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4908: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671: havoc main_~node3__m3~5#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3455: havoc main_~node4__m4~18#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5636: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~57#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872: havoc main_~check__tmp~14#1;havoc main_~node4__m4~9#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4119: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~39#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L684: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node2__m2~1#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: havoc main_~node4__m4~4#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3990: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:59,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4651: havoc main_~node3__m3~9#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5114: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~51#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3333: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5844: havoc main_~node4__m4~32#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node4__m4~2#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: havoc main_~node4__m4~13#1; [2025-03-03 15:07:59,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4525: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5516: havoc main_~node4__m4~30#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1222: havoc main_~check__tmp~7#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4790: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~47#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2016: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1422: havoc main_~node3__m3~4#1; [2025-03-03 15:07:59,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4197: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~40#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:07:59,688 INFO L? ?]: Removed 517 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:59,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:59,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:59,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:59,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:59 BoogieIcfgContainer [2025-03-03 15:07:59,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:59,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:59,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:59,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:59,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:57" (1/3) ... [2025-03-03 15:07:59,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7660de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:59, skipping insertion in model container [2025-03-03 15:07:59,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:57" (2/3) ... [2025-03-03 15:07:59,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7660de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:59, skipping insertion in model container [2025-03-03 15:07:59,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:59" (3/3) ... [2025-03-03 15:07:59,724 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:07:59,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:59,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 702 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 15:07:59,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:59,806 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;@4945b57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:59,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:07:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 702 states, 699 states have (on average 1.7854077253218885) internal successors, (1248), 701 states have internal predecessors, (1248), 0 states have call successors, (0), 0 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-03 15:07:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:07:59,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,827 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] [2025-03-03 15:07:59,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1427402123, now seen corresponding path program 1 times [2025-03-03 15:07:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274473073] [2025-03-03 15:07:59,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:08:00,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:08:00,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,225 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-03 15:08:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274473073] [2025-03-03 15:08:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274473073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281347499] [2025-03-03 15:08:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,248 INFO L87 Difference]: Start difference. First operand has 702 states, 699 states have (on average 1.7854077253218885) internal successors, (1248), 701 states have internal predecessors, (1248), 0 states have call successors, (0), 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 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,344 INFO L93 Difference]: Finished difference Result 1063 states and 1849 transitions. [2025-03-03 15:08:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:08:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,359 INFO L225 Difference]: With dead ends: 1063 [2025-03-03 15:08:00,359 INFO L226 Difference]: Without dead ends: 842 [2025-03-03 15:08:00,361 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-03 15:08:00,363 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 630 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2071 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-03 15:08:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840. [2025-03-03 15:08:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.3723150357995226) internal successors, (1150), 839 states have internal predecessors, (1150), 0 states have call successors, (0), 0 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-03 15:08:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1150 transitions. [2025-03-03 15:08:00,418 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1150 transitions. Word has length 62 [2025-03-03 15:08:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,418 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1150 transitions. [2025-03-03 15:08:00,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1150 transitions. [2025-03-03 15:08:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:08:00,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,421 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] [2025-03-03 15:08:00,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:08:00,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1264937203, now seen corresponding path program 1 times [2025-03-03 15:08:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612424761] [2025-03-03 15:08:00,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:08:00,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:08:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,548 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-03 15:08:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612424761] [2025-03-03 15:08:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612424761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757535862] [2025-03-03 15:08:00,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,550 INFO L87 Difference]: Start difference. First operand 840 states and 1150 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,605 INFO L93 Difference]: Finished difference Result 1406 states and 1994 transitions. [2025-03-03 15:08:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:08:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,609 INFO L225 Difference]: With dead ends: 1406 [2025-03-03 15:08:00,609 INFO L226 Difference]: Without dead ends: 1102 [2025-03-03 15:08:00,612 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-03 15:08:00,613 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 495 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1572 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-03 15:08:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1098. [2025-03-03 15:08:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1096 states have (on average 1.3932481751824817) internal successors, (1527), 1097 states have internal predecessors, (1527), 0 states have call successors, (0), 0 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-03 15:08:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1527 transitions. [2025-03-03 15:08:00,648 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1527 transitions. Word has length 63 [2025-03-03 15:08:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,648 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1527 transitions. [2025-03-03 15:08:00,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1527 transitions. [2025-03-03 15:08:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:08:00,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,650 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] [2025-03-03 15:08:00,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:00,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1600718862, now seen corresponding path program 1 times [2025-03-03 15:08:00,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736645816] [2025-03-03 15:08:00,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:08:00,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:08:00,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,763 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-03 15:08:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736645816] [2025-03-03 15:08:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736645816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301099740] [2025-03-03 15:08:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,766 INFO L87 Difference]: Start difference. First operand 1098 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,863 INFO L93 Difference]: Finished difference Result 2104 states and 2958 transitions. [2025-03-03 15:08:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:08:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,869 INFO L225 Difference]: With dead ends: 2104 [2025-03-03 15:08:00,869 INFO L226 Difference]: Without dead ends: 1684 [2025-03-03 15:08:00,870 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-03 15:08:00,870 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 548 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1679 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-03 15:08:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1680. [2025-03-03 15:08:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.3790226460071513) internal successors, (2314), 1679 states have internal predecessors, (2314), 0 states have call successors, (0), 0 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-03 15:08:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2314 transitions. [2025-03-03 15:08:00,898 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2314 transitions. Word has length 63 [2025-03-03 15:08:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,899 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2314 transitions. [2025-03-03 15:08:00,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2314 transitions. [2025-03-03 15:08:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:08:00,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,901 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] [2025-03-03 15:08:00,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:00,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1017737198, now seen corresponding path program 1 times [2025-03-03 15:08:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100929585] [2025-03-03 15:08:00,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:08:00,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:08:00,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100929585] [2025-03-03 15:08:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100929585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168646654] [2025-03-03 15:08:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:01,077 INFO L87 Difference]: Start difference. First operand 1680 states and 2314 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,528 INFO L93 Difference]: Finished difference Result 3709 states and 5233 transitions. [2025-03-03 15:08:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:08:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,537 INFO L225 Difference]: With dead ends: 3709 [2025-03-03 15:08:01,537 INFO L226 Difference]: Without dead ends: 2253 [2025-03-03 15:08:01,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:01,541 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2609 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 572 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2025-03-03 15:08:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2251. [2025-03-03 15:08:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2249 states have (on average 1.4104046242774566) internal successors, (3172), 2250 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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-03 15:08:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3172 transitions. [2025-03-03 15:08:01,595 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3172 transitions. Word has length 63 [2025-03-03 15:08:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,595 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3172 transitions. [2025-03-03 15:08:01,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-03 15:08:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3172 transitions. [2025-03-03 15:08:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:08:01,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,599 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] [2025-03-03 15:08:01,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:01,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 288375096, now seen corresponding path program 1 times [2025-03-03 15:08:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112069111] [2025-03-03 15:08:01,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:08:01,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:08:01,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112069111] [2025-03-03 15:08:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112069111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393949092] [2025-03-03 15:08:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:01,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:01,701 INFO L87 Difference]: Start difference. First operand 2251 states and 3172 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 15:08:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,744 INFO L93 Difference]: Finished difference Result 4648 states and 6627 transitions. [2025-03-03 15:08:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:08:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,755 INFO L225 Difference]: With dead ends: 4648 [2025-03-03 15:08:01,755 INFO L226 Difference]: Without dead ends: 3138 [2025-03-03 15:08:01,758 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-03 15:08:01,759 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 578 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1480 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2025-03-03 15:08:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3128. [2025-03-03 15:08:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3126 states have (on average 1.3909149072296865) internal successors, (4348), 3127 states have internal predecessors, (4348), 0 states have call successors, (0), 0 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-03 15:08:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4348 transitions. [2025-03-03 15:08:01,823 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4348 transitions. Word has length 64 [2025-03-03 15:08:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,824 INFO L471 AbstractCegarLoop]: Abstraction has 3128 states and 4348 transitions. [2025-03-03 15:08:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 15:08:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4348 transitions. [2025-03-03 15:08:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:01,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,829 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] [2025-03-03 15:08:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:01,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2014557827, now seen corresponding path program 1 times [2025-03-03 15:08:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120708860] [2025-03-03 15:08:01,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:01,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:01,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,970 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-03 15:08:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120708860] [2025-03-03 15:08:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120708860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079094977] [2025-03-03 15:08:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:01,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:01,972 INFO L87 Difference]: Start difference. First operand 3128 states and 4348 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,302 INFO L93 Difference]: Finished difference Result 6737 states and 9460 transitions. [2025-03-03 15:08:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:02,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:08:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:02,313 INFO L225 Difference]: With dead ends: 6737 [2025-03-03 15:08:02,313 INFO L226 Difference]: Without dead ends: 3943 [2025-03-03 15:08:02,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:02,316 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 2279 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:02,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 520 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-03 15:08:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3927. [2025-03-03 15:08:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3925 states have (on average 1.3946496815286624) internal successors, (5474), 3926 states have internal predecessors, (5474), 0 states have call successors, (0), 0 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-03 15:08:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5474 transitions. [2025-03-03 15:08:02,381 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5474 transitions. Word has length 65 [2025-03-03 15:08:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:02,381 INFO L471 AbstractCegarLoop]: Abstraction has 3927 states and 5474 transitions. [2025-03-03 15:08:02,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5474 transitions. [2025-03-03 15:08:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:02,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:02,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:02,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:02,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 223504234, now seen corresponding path program 1 times [2025-03-03 15:08:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:02,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303398751] [2025-03-03 15:08:02,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:02,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:02,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:02,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303398751] [2025-03-03 15:08:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303398751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837371037] [2025-03-03 15:08:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:02,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:02,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:02,530 INFO L87 Difference]: Start difference. First operand 3927 states and 5474 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:03,046 INFO L93 Difference]: Finished difference Result 8087 states and 11509 transitions. [2025-03-03 15:08:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:03,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,065 INFO L225 Difference]: With dead ends: 8087 [2025-03-03 15:08:03,065 INFO L226 Difference]: Without dead ends: 6921 [2025-03-03 15:08:03,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:03,070 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 3109 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3109 Valid, 1016 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2025-03-03 15:08:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 3951. [2025-03-03 15:08:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3949 states have (on average 1.3942770321600406) internal successors, (5506), 3950 states have internal predecessors, (5506), 0 states have call successors, (0), 0 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-03 15:08:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5506 transitions. [2025-03-03 15:08:03,159 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5506 transitions. Word has length 66 [2025-03-03 15:08:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,160 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 5506 transitions. [2025-03-03 15:08:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5506 transitions. [2025-03-03 15:08:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:03,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:03,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:03,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1654180454, now seen corresponding path program 1 times [2025-03-03 15:08:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805984915] [2025-03-03 15:08:03,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:03,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:03,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,289 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-03 15:08:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805984915] [2025-03-03 15:08:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805984915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136510474] [2025-03-03 15:08:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:03,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:03,291 INFO L87 Difference]: Start difference. First operand 3951 states and 5506 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:03,601 INFO L93 Difference]: Finished difference Result 8920 states and 12504 transitions. [2025-03-03 15:08:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:03,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,619 INFO L225 Difference]: With dead ends: 8920 [2025-03-03 15:08:03,619 INFO L226 Difference]: Without dead ends: 5278 [2025-03-03 15:08:03,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:03,624 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 2343 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2343 Valid, 529 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2025-03-03 15:08:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 3951. [2025-03-03 15:08:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3949 states have (on average 1.3894656875158269) internal successors, (5487), 3950 states have internal predecessors, (5487), 0 states have call successors, (0), 0 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-03 15:08:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5487 transitions. [2025-03-03 15:08:03,696 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5487 transitions. Word has length 66 [2025-03-03 15:08:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,696 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 5487 transitions. [2025-03-03 15:08:03,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5487 transitions. [2025-03-03 15:08:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:03,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:03,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:03,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1447461671, now seen corresponding path program 1 times [2025-03-03 15:08:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160700280] [2025-03-03 15:08:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,838 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-03 15:08:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160700280] [2025-03-03 15:08:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160700280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679085507] [2025-03-03 15:08:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:03,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:03,840 INFO L87 Difference]: Start difference. First operand 3951 states and 5487 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,180 INFO L93 Difference]: Finished difference Result 8809 states and 12246 transitions. [2025-03-03 15:08:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,190 INFO L225 Difference]: With dead ends: 8809 [2025-03-03 15:08:04,190 INFO L226 Difference]: Without dead ends: 5138 [2025-03-03 15:08:04,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:04,194 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 2061 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 484 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2025-03-03 15:08:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 5116. [2025-03-03 15:08:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5116 states, 5114 states have (on average 1.375831052014079) internal successors, (7036), 5115 states have internal predecessors, (7036), 0 states have call successors, (0), 0 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-03 15:08:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 7036 transitions. [2025-03-03 15:08:04,257 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 7036 transitions. Word has length 67 [2025-03-03 15:08:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 5116 states and 7036 transitions. [2025-03-03 15:08:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 7036 transitions. [2025-03-03 15:08:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:04,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:04,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:04,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:04,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1734953682, now seen corresponding path program 1 times [2025-03-03 15:08:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038459078] [2025-03-03 15:08:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:04,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:04,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:04,376 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-03 15:08:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038459078] [2025-03-03 15:08:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038459078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97456254] [2025-03-03 15:08:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:04,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:04,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:04,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:04,378 INFO L87 Difference]: Start difference. First operand 5116 states and 7036 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,842 INFO L93 Difference]: Finished difference Result 10598 states and 14766 transitions. [2025-03-03 15:08:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,854 INFO L225 Difference]: With dead ends: 10598 [2025-03-03 15:08:04,854 INFO L226 Difference]: Without dead ends: 8118 [2025-03-03 15:08:04,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:04,858 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 2664 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 931 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8118 states. [2025-03-03 15:08:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8118 to 5144. [2025-03-03 15:08:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5144 states, 5142 states have (on average 1.3753403345001944) internal successors, (7072), 5143 states have internal predecessors, (7072), 0 states have call successors, (0), 0 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-03 15:08:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 7072 transitions. [2025-03-03 15:08:04,937 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 7072 transitions. Word has length 67 [2025-03-03 15:08:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,937 INFO L471 AbstractCegarLoop]: Abstraction has 5144 states and 7072 transitions. [2025-03-03 15:08:04,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 7072 transitions. [2025-03-03 15:08:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:04,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:04,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:04,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 423979062, now seen corresponding path program 1 times [2025-03-03 15:08:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679996251] [2025-03-03 15:08:04,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:04,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:04,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:05,069 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-03 15:08:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679996251] [2025-03-03 15:08:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679996251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980846836] [2025-03-03 15:08:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:05,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:05,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:05,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:05,071 INFO L87 Difference]: Start difference. First operand 5144 states and 7072 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:05,564 INFO L93 Difference]: Finished difference Result 12952 states and 18195 transitions. [2025-03-03 15:08:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:05,581 INFO L225 Difference]: With dead ends: 12952 [2025-03-03 15:08:05,581 INFO L226 Difference]: Without dead ends: 10752 [2025-03-03 15:08:05,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:05,587 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2900 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:05,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 995 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10752 states. [2025-03-03 15:08:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10752 to 5241. [2025-03-03 15:08:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5239 states have (on average 1.3744989501813323) internal successors, (7201), 5240 states have internal predecessors, (7201), 0 states have call successors, (0), 0 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-03 15:08:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 7201 transitions. [2025-03-03 15:08:05,681 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 7201 transitions. Word has length 68 [2025-03-03 15:08:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 5241 states and 7201 transitions. [2025-03-03 15:08:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 7201 transitions. [2025-03-03 15:08:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:05,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,686 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] [2025-03-03 15:08:05,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:05,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1091975041, now seen corresponding path program 1 times [2025-03-03 15:08:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229465772] [2025-03-03 15:08:05,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:05,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:05,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:05,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:05,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,024 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-03 15:08:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229465772] [2025-03-03 15:08:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229465772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784440507] [2025-03-03 15:08:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:06,026 INFO L87 Difference]: Start difference. First operand 5241 states and 7201 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 15:08:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,932 INFO L93 Difference]: Finished difference Result 9228 states and 12784 transitions. [2025-03-03 15:08:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,944 INFO L225 Difference]: With dead ends: 9228 [2025-03-03 15:08:06,944 INFO L226 Difference]: Without dead ends: 7610 [2025-03-03 15:08:06,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:06,948 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 2622 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 2068 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2025-03-03 15:08:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 5241. [2025-03-03 15:08:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5239 states have (on average 1.3741171979385378) internal successors, (7199), 5240 states have internal predecessors, (7199), 0 states have call successors, (0), 0 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-03 15:08:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 7199 transitions. [2025-03-03 15:08:07,045 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 7199 transitions. Word has length 69 [2025-03-03 15:08:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 5241 states and 7199 transitions. [2025-03-03 15:08:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 15:08:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 7199 transitions. [2025-03-03 15:08:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:07,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,050 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] [2025-03-03 15:08:07,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:07,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:07,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1766605819, now seen corresponding path program 1 times [2025-03-03 15:08:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097808910] [2025-03-03 15:08:07,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:07,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:07,333 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-03 15:08:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097808910] [2025-03-03 15:08:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097808910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905067469] [2025-03-03 15:08:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:07,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:07,334 INFO L87 Difference]: Start difference. First operand 5241 states and 7199 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 15:08:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:08,035 INFO L93 Difference]: Finished difference Result 10789 states and 15111 transitions. [2025-03-03 15:08:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:08,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:08,050 INFO L225 Difference]: With dead ends: 10789 [2025-03-03 15:08:08,050 INFO L226 Difference]: Without dead ends: 7755 [2025-03-03 15:08:08,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:08,056 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 2814 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:08,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 1879 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:08:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2025-03-03 15:08:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 5237. [2025-03-03 15:08:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5237 states, 5235 states have (on average 1.3736389684813755) internal successors, (7191), 5236 states have internal predecessors, (7191), 0 states have call successors, (0), 0 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-03 15:08:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5237 states to 5237 states and 7191 transitions. [2025-03-03 15:08:08,130 INFO L78 Accepts]: Start accepts. Automaton has 5237 states and 7191 transitions. Word has length 69 [2025-03-03 15:08:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:08,130 INFO L471 AbstractCegarLoop]: Abstraction has 5237 states and 7191 transitions. [2025-03-03 15:08:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 15:08:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5237 states and 7191 transitions. [2025-03-03 15:08:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:08,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:08,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:08,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:08,136 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:08,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 360944512, now seen corresponding path program 1 times [2025-03-03 15:08:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606862265] [2025-03-03 15:08:08,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:08,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:08,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:08,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:08,672 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-03 15:08:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606862265] [2025-03-03 15:08:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606862265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830987325] [2025-03-03 15:08:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:08,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:08,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:08,673 INFO L87 Difference]: Start difference. First operand 5237 states and 7191 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:09,400 INFO L93 Difference]: Finished difference Result 11683 states and 16435 transitions. [2025-03-03 15:08:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:09,411 INFO L225 Difference]: With dead ends: 11683 [2025-03-03 15:08:09,412 INFO L226 Difference]: Without dead ends: 8651 [2025-03-03 15:08:09,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:09,415 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 3632 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3632 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:09,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3632 Valid, 2963 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2025-03-03 15:08:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 5231. [2025-03-03 15:08:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5229 states have (on average 1.3729202524383248) internal successors, (7179), 5230 states have internal predecessors, (7179), 0 states have call successors, (0), 0 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-03 15:08:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 7179 transitions. [2025-03-03 15:08:09,475 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 7179 transitions. Word has length 70 [2025-03-03 15:08:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 5231 states and 7179 transitions. [2025-03-03 15:08:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 7179 transitions. [2025-03-03 15:08:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:09,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:09,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:09,480 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 892093495, now seen corresponding path program 1 times [2025-03-03 15:08:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474252792] [2025-03-03 15:08:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:09,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:09,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:09,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:09,730 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-03 15:08:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474252792] [2025-03-03 15:08:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474252792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638161057] [2025-03-03 15:08:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:09,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:09,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:09,732 INFO L87 Difference]: Start difference. First operand 5231 states and 7179 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:10,403 INFO L93 Difference]: Finished difference Result 10883 states and 15248 transitions. [2025-03-03 15:08:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:10,411 INFO L225 Difference]: With dead ends: 10883 [2025-03-03 15:08:10,412 INFO L226 Difference]: Without dead ends: 7807 [2025-03-03 15:08:10,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:10,417 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 2839 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:10,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 1812 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2025-03-03 15:08:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 5207. [2025-03-03 15:08:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5207 states, 5205 states have (on average 1.3717579250720462) internal successors, (7140), 5206 states have internal predecessors, (7140), 0 states have call successors, (0), 0 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-03 15:08:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5207 states to 5207 states and 7140 transitions. [2025-03-03 15:08:10,480 INFO L78 Accepts]: Start accepts. Automaton has 5207 states and 7140 transitions. Word has length 70 [2025-03-03 15:08:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 5207 states and 7140 transitions. [2025-03-03 15:08:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5207 states and 7140 transitions. [2025-03-03 15:08:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:10,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:10,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:10,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 85532336, now seen corresponding path program 1 times [2025-03-03 15:08:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819969045] [2025-03-03 15:08:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:10,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:10,998 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-03 15:08:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819969045] [2025-03-03 15:08:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819969045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158153880] [2025-03-03 15:08:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:10,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:10,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:10,999 INFO L87 Difference]: Start difference. First operand 5207 states and 7140 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,969 INFO L93 Difference]: Finished difference Result 17247 states and 24361 transitions. [2025-03-03 15:08:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,987 INFO L225 Difference]: With dead ends: 17247 [2025-03-03 15:08:11,987 INFO L226 Difference]: Without dead ends: 14195 [2025-03-03 15:08:11,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:11,995 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 3630 mSDsluCounter, 3848 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3630 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3630 Valid, 4412 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14195 states. [2025-03-03 15:08:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14195 to 5181. [2025-03-03 15:08:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5179 states have (on average 1.3716933770998263) internal successors, (7104), 5180 states have internal predecessors, (7104), 0 states have call successors, (0), 0 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-03 15:08:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7104 transitions. [2025-03-03 15:08:12,096 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7104 transitions. Word has length 70 [2025-03-03 15:08:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:12,096 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 7104 transitions. [2025-03-03 15:08:12,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7104 transitions. [2025-03-03 15:08:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:12,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:12,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:12,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:12,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1691742126, now seen corresponding path program 1 times [2025-03-03 15:08:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095008168] [2025-03-03 15:08:12,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:12,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:12,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:12,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:12,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:12,205 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-03 15:08:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095008168] [2025-03-03 15:08:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095008168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440902158] [2025-03-03 15:08:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:12,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:12,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:12,207 INFO L87 Difference]: Start difference. First operand 5181 states and 7104 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:12,703 INFO L93 Difference]: Finished difference Result 11681 states and 16337 transitions. [2025-03-03 15:08:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:12,714 INFO L225 Difference]: With dead ends: 11681 [2025-03-03 15:08:12,714 INFO L226 Difference]: Without dead ends: 9645 [2025-03-03 15:08:12,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:12,717 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2762 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:12,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 964 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2025-03-03 15:08:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 5252. [2025-03-03 15:08:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 5250 states have (on average 1.372) internal successors, (7203), 5251 states have internal predecessors, (7203), 0 states have call successors, (0), 0 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-03 15:08:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7203 transitions. [2025-03-03 15:08:12,787 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7203 transitions. Word has length 70 [2025-03-03 15:08:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:12,787 INFO L471 AbstractCegarLoop]: Abstraction has 5252 states and 7203 transitions. [2025-03-03 15:08:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7203 transitions. [2025-03-03 15:08:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:12,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:12,791 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] [2025-03-03 15:08:12,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:12,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 326028484, now seen corresponding path program 1 times [2025-03-03 15:08:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835282612] [2025-03-03 15:08:12,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:12,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:12,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:12,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:13,186 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-03 15:08:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835282612] [2025-03-03 15:08:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835282612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:13,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:08:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448071367] [2025-03-03 15:08:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:13,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:08:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:08:13,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:13,188 INFO L87 Difference]: Start difference. First operand 5252 states and 7203 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,094 INFO L93 Difference]: Finished difference Result 17722 states and 24895 transitions. [2025-03-03 15:08:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:08:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:08:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,116 INFO L225 Difference]: With dead ends: 17722 [2025-03-03 15:08:14,116 INFO L226 Difference]: Without dead ends: 15589 [2025-03-03 15:08:14,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:08:14,123 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 3876 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3876 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3876 Valid, 3878 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:08:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15589 states. [2025-03-03 15:08:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15589 to 5237. [2025-03-03 15:08:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5237 states, 5235 states have (on average 1.3717287488061127) internal successors, (7181), 5236 states have internal predecessors, (7181), 0 states have call successors, (0), 0 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-03 15:08:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5237 states to 5237 states and 7181 transitions. [2025-03-03 15:08:14,248 INFO L78 Accepts]: Start accepts. Automaton has 5237 states and 7181 transitions. Word has length 71 [2025-03-03 15:08:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,248 INFO L471 AbstractCegarLoop]: Abstraction has 5237 states and 7181 transitions. [2025-03-03 15:08:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5237 states and 7181 transitions. [2025-03-03 15:08:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,252 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] [2025-03-03 15:08:14,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:14,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:14,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1015417146, now seen corresponding path program 1 times [2025-03-03 15:08:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832656265] [2025-03-03 15:08:14,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:14,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:14,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:14,336 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-03 15:08:14,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:14,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832656265] [2025-03-03 15:08:14,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832656265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:14,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:14,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839544513] [2025-03-03 15:08:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:14,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:14,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:14,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:14,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:14,339 INFO L87 Difference]: Start difference. First operand 5237 states and 7181 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,772 INFO L93 Difference]: Finished difference Result 11661 states and 16312 transitions. [2025-03-03 15:08:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:08:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,782 INFO L225 Difference]: With dead ends: 11661 [2025-03-03 15:08:14,782 INFO L226 Difference]: Without dead ends: 9637 [2025-03-03 15:08:14,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:14,787 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2761 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2761 Valid, 964 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2025-03-03 15:08:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 5280. [2025-03-03 15:08:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 5278 states have (on average 1.372110647972717) internal successors, (7242), 5279 states have internal predecessors, (7242), 0 states have call successors, (0), 0 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-03 15:08:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 7242 transitions. [2025-03-03 15:08:14,863 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 7242 transitions. Word has length 71 [2025-03-03 15:08:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 7242 transitions. [2025-03-03 15:08:14,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 7242 transitions. [2025-03-03 15:08:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:14,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,867 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] [2025-03-03 15:08:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:14,868 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1091629974, now seen corresponding path program 1 times [2025-03-03 15:08:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537062026] [2025-03-03 15:08:14,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:14,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,147 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-03 15:08:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537062026] [2025-03-03 15:08:15,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537062026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956357172] [2025-03-03 15:08:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:15,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:15,149 INFO L87 Difference]: Start difference. First operand 5280 states and 7242 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:15,848 INFO L93 Difference]: Finished difference Result 12433 states and 17407 transitions. [2025-03-03 15:08:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:08:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:15,855 INFO L225 Difference]: With dead ends: 12433 [2025-03-03 15:08:15,855 INFO L226 Difference]: Without dead ends: 9173 [2025-03-03 15:08:15,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:15,859 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 2787 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:15,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 2191 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9173 states. [2025-03-03 15:08:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9173 to 5155. [2025-03-03 15:08:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5153 states have (on average 1.3725984863186493) internal successors, (7073), 5154 states have internal predecessors, (7073), 0 states have call successors, (0), 0 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-03 15:08:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7073 transitions. [2025-03-03 15:08:15,923 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7073 transitions. Word has length 71 [2025-03-03 15:08:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:15,923 INFO L471 AbstractCegarLoop]: Abstraction has 5155 states and 7073 transitions. [2025-03-03 15:08:15,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 15:08:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7073 transitions. [2025-03-03 15:08:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:15,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:15,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:15,927 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1291118805, now seen corresponding path program 1 times [2025-03-03 15:08:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480633961] [2025-03-03 15:08:15,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:15,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:15,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:15,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:15,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,964 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-03 15:08:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480633961] [2025-03-03 15:08:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480633961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997065396] [2025-03-03 15:08:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:15,966 INFO L87 Difference]: Start difference. First operand 5155 states and 7073 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,065 INFO L93 Difference]: Finished difference Result 9908 states and 13727 transitions. [2025-03-03 15:08:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,072 INFO L225 Difference]: With dead ends: 9908 [2025-03-03 15:08:16,072 INFO L226 Difference]: Without dead ends: 7027 [2025-03-03 15:08:16,076 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-03 15:08:16,077 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 505 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 656 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2025-03-03 15:08:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7005. [2025-03-03 15:08:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.39083250035699) internal successors, (9740), 7004 states have internal predecessors, (9740), 0 states have call successors, (0), 0 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-03 15:08:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 9740 transitions. [2025-03-03 15:08:16,166 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 9740 transitions. Word has length 72 [2025-03-03 15:08:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,166 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 9740 transitions. [2025-03-03 15:08:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 9740 transitions. [2025-03-03 15:08:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:16,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:16,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:16,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1197837623, now seen corresponding path program 1 times [2025-03-03 15:08:16,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819064729] [2025-03-03 15:08:16,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:16,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:16,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,208 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-03 15:08:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819064729] [2025-03-03 15:08:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819064729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091707814] [2025-03-03 15:08:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:16,210 INFO L87 Difference]: Start difference. First operand 7005 states and 9740 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,248 INFO L93 Difference]: Finished difference Result 10602 states and 14851 transitions. [2025-03-03 15:08:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,255 INFO L225 Difference]: With dead ends: 10602 [2025-03-03 15:08:16,255 INFO L226 Difference]: Without dead ends: 7009 [2025-03-03 15:08:16,258 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-03 15:08:16,260 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 332 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1167 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7009 states. [2025-03-03 15:08:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7009 to 7005. [2025-03-03 15:08:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.3784092531772099) internal successors, (9653), 7004 states have internal predecessors, (9653), 0 states have call successors, (0), 0 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-03 15:08:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 9653 transitions. [2025-03-03 15:08:16,325 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 9653 transitions. Word has length 72 [2025-03-03 15:08:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,326 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 9653 transitions. [2025-03-03 15:08:16,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 9653 transitions. [2025-03-03 15:08:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:16,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:16,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:16,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1755684043, now seen corresponding path program 1 times [2025-03-03 15:08:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793467459] [2025-03-03 15:08:16,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,530 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-03 15:08:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793467459] [2025-03-03 15:08:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793467459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037143024] [2025-03-03 15:08:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:16,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:16,532 INFO L87 Difference]: Start difference. First operand 7005 states and 9653 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,200 INFO L93 Difference]: Finished difference Result 9908 states and 13726 transitions. [2025-03-03 15:08:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:17,206 INFO L225 Difference]: With dead ends: 9908 [2025-03-03 15:08:17,206 INFO L226 Difference]: Without dead ends: 8035 [2025-03-03 15:08:17,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:17,209 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2324 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:17,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 1980 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8035 states. [2025-03-03 15:08:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8035 to 7005. [2025-03-03 15:08:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.3781236612880194) internal successors, (9651), 7004 states have internal predecessors, (9651), 0 states have call successors, (0), 0 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-03 15:08:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 9651 transitions. [2025-03-03 15:08:17,273 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 9651 transitions. Word has length 72 [2025-03-03 15:08:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:17,273 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 9651 transitions. [2025-03-03 15:08:17,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 9651 transitions. [2025-03-03 15:08:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:17,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:17,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:17,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:17,277 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:17,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1350882622, now seen corresponding path program 1 times [2025-03-03 15:08:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381676463] [2025-03-03 15:08:17,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:17,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:17,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:17,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:17,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,617 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-03 15:08:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381676463] [2025-03-03 15:08:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381676463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330830483] [2025-03-03 15:08:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:17,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:17,619 INFO L87 Difference]: Start difference. First operand 7005 states and 9651 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:18,587 INFO L93 Difference]: Finished difference Result 14911 states and 20839 transitions. [2025-03-03 15:08:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:08:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:18,599 INFO L225 Difference]: With dead ends: 14911 [2025-03-03 15:08:18,599 INFO L226 Difference]: Without dead ends: 13221 [2025-03-03 15:08:18,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:08:18,603 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 3847 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3847 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3847 Valid, 3442 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13221 states. [2025-03-03 15:08:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13221 to 7003. [2025-03-03 15:08:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7003 states, 7001 states have (on average 1.3779460077131838) internal successors, (9647), 7002 states have internal predecessors, (9647), 0 states have call successors, (0), 0 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-03 15:08:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 9647 transitions. [2025-03-03 15:08:18,678 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 9647 transitions. Word has length 72 [2025-03-03 15:08:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:18,678 INFO L471 AbstractCegarLoop]: Abstraction has 7003 states and 9647 transitions. [2025-03-03 15:08:18,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 9647 transitions. [2025-03-03 15:08:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:18,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:18,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:18,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:18,682 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash -602971453, now seen corresponding path program 1 times [2025-03-03 15:08:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160579818] [2025-03-03 15:08:18,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:18,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:18,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:18,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:18,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:18,786 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-03 15:08:18,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:18,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160579818] [2025-03-03 15:08:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160579818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:18,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406821189] [2025-03-03 15:08:18,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:18,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:18,788 INFO L87 Difference]: Start difference. First operand 7003 states and 9647 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,189 INFO L93 Difference]: Finished difference Result 17013 states and 23803 transitions. [2025-03-03 15:08:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,202 INFO L225 Difference]: With dead ends: 17013 [2025-03-03 15:08:19,202 INFO L226 Difference]: Without dead ends: 15863 [2025-03-03 15:08:19,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:19,207 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2661 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2661 Valid, 919 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15863 states. [2025-03-03 15:08:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15863 to 7012. [2025-03-03 15:08:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7012 states, 7010 states have (on average 1.3776034236804564) internal successors, (9657), 7011 states have internal predecessors, (9657), 0 states have call successors, (0), 0 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-03 15:08:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 9657 transitions. [2025-03-03 15:08:19,328 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 9657 transitions. Word has length 72 [2025-03-03 15:08:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,328 INFO L471 AbstractCegarLoop]: Abstraction has 7012 states and 9657 transitions. [2025-03-03 15:08:19,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 9657 transitions. [2025-03-03 15:08:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:19,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,331 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] [2025-03-03 15:08:19,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:19,332 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -468576876, now seen corresponding path program 1 times [2025-03-03 15:08:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368423480] [2025-03-03 15:08:19,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:19,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:19,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,365 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-03 15:08:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368423480] [2025-03-03 15:08:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368423480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323468333] [2025-03-03 15:08:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:19,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,366 INFO L87 Difference]: Start difference. First operand 7012 states and 9657 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-03 15:08:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,396 INFO L93 Difference]: Finished difference Result 9840 states and 13564 transitions. [2025-03-03 15:08:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:19,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:08:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,402 INFO L225 Difference]: With dead ends: 9840 [2025-03-03 15:08:19,402 INFO L226 Difference]: Without dead ends: 6864 [2025-03-03 15:08:19,405 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-03 15:08:19,405 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 397 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1020 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2025-03-03 15:08:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 6862. [2025-03-03 15:08:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6860 states have (on average 1.364139941690962) internal successors, (9358), 6861 states have internal predecessors, (9358), 0 states have call successors, (0), 0 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-03 15:08:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 9358 transitions. [2025-03-03 15:08:19,463 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 9358 transitions. Word has length 73 [2025-03-03 15:08:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,463 INFO L471 AbstractCegarLoop]: Abstraction has 6862 states and 9358 transitions. [2025-03-03 15:08:19,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-03 15:08:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 9358 transitions. [2025-03-03 15:08:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:19,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,467 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] [2025-03-03 15:08:19,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:19,467 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash -570910274, now seen corresponding path program 1 times [2025-03-03 15:08:19,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834355996] [2025-03-03 15:08:19,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:19,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:19,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834355996] [2025-03-03 15:08:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834355996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739914789] [2025-03-03 15:08:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:19,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,505 INFO L87 Difference]: Start difference. First operand 6862 states and 9358 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-03 15:08:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,537 INFO L93 Difference]: Finished difference Result 10516 states and 14443 transitions. [2025-03-03 15:08:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:08:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,543 INFO L225 Difference]: With dead ends: 10516 [2025-03-03 15:08:19,543 INFO L226 Difference]: Without dead ends: 6864 [2025-03-03 15:08:19,546 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-03 15:08:19,547 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 380 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2025-03-03 15:08:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 6862. [2025-03-03 15:08:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6860 states have (on average 1.353790087463557) internal successors, (9287), 6861 states have internal predecessors, (9287), 0 states have call successors, (0), 0 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-03 15:08:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 9287 transitions. [2025-03-03 15:08:19,601 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 9287 transitions. Word has length 73 [2025-03-03 15:08:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,601 INFO L471 AbstractCegarLoop]: Abstraction has 6862 states and 9287 transitions. [2025-03-03 15:08:19,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-03 15:08:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 9287 transitions. [2025-03-03 15:08:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:19,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:19,605 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 86793967, now seen corresponding path program 1 times [2025-03-03 15:08:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121417528] [2025-03-03 15:08:19,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,652 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-03 15:08:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121417528] [2025-03-03 15:08:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121417528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361557276] [2025-03-03 15:08:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:19,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,653 INFO L87 Difference]: Start difference. First operand 6862 states and 9287 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,716 INFO L93 Difference]: Finished difference Result 12591 states and 17178 transitions. [2025-03-03 15:08:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,723 INFO L225 Difference]: With dead ends: 12591 [2025-03-03 15:08:19,723 INFO L226 Difference]: Without dead ends: 8504 [2025-03-03 15:08:19,728 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-03 15:08:19,728 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 440 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 677 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2025-03-03 15:08:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 6491. [2025-03-03 15:08:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6491 states, 6489 states have (on average 1.3555247341655108) internal successors, (8796), 6490 states have internal predecessors, (8796), 0 states have call successors, (0), 0 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-03 15:08:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 8796 transitions. [2025-03-03 15:08:19,780 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 8796 transitions. Word has length 74 [2025-03-03 15:08:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,780 INFO L471 AbstractCegarLoop]: Abstraction has 6491 states and 8796 transitions. [2025-03-03 15:08:19,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 8796 transitions. [2025-03-03 15:08:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:19,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:19,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:19,782 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -857638951, now seen corresponding path program 1 times [2025-03-03 15:08:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484063194] [2025-03-03 15:08:19,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:19,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:19,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484063194] [2025-03-03 15:08:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484063194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729260869] [2025-03-03 15:08:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:19,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:19,925 INFO L87 Difference]: Start difference. First operand 6491 states and 8796 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,404 INFO L93 Difference]: Finished difference Result 13627 states and 18704 transitions. [2025-03-03 15:08:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,418 INFO L225 Difference]: With dead ends: 13627 [2025-03-03 15:08:20,419 INFO L226 Difference]: Without dead ends: 13320 [2025-03-03 15:08:20,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:20,423 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1801 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 1616 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13320 states. [2025-03-03 15:08:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13320 to 6487. [2025-03-03 15:08:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6487 states, 6485 states have (on average 1.3551272166538164) internal successors, (8788), 6486 states have internal predecessors, (8788), 0 states have call successors, (0), 0 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-03 15:08:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6487 states to 6487 states and 8788 transitions. [2025-03-03 15:08:20,503 INFO L78 Accepts]: Start accepts. Automaton has 6487 states and 8788 transitions. Word has length 74 [2025-03-03 15:08:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,503 INFO L471 AbstractCegarLoop]: Abstraction has 6487 states and 8788 transitions. [2025-03-03 15:08:20,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6487 states and 8788 transitions. [2025-03-03 15:08:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:20,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:20,507 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash -324362103, now seen corresponding path program 1 times [2025-03-03 15:08:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551807564] [2025-03-03 15:08:20,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:20,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,783 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-03 15:08:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551807564] [2025-03-03 15:08:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551807564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029639650] [2025-03-03 15:08:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:20,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:20,784 INFO L87 Difference]: Start difference. First operand 6487 states and 8788 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,567 INFO L93 Difference]: Finished difference Result 19797 states and 27089 transitions. [2025-03-03 15:08:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:08:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,586 INFO L225 Difference]: With dead ends: 19797 [2025-03-03 15:08:21,586 INFO L226 Difference]: Without dead ends: 19489 [2025-03-03 15:08:21,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:08:21,594 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 4738 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 1591 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19489 states. [2025-03-03 15:08:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19489 to 6491. [2025-03-03 15:08:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6491 states, 6489 states have (on average 1.354908306364617) internal successors, (8792), 6490 states have internal predecessors, (8792), 0 states have call successors, (0), 0 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-03 15:08:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 8792 transitions. [2025-03-03 15:08:21,724 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 8792 transitions. Word has length 74 [2025-03-03 15:08:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,724 INFO L471 AbstractCegarLoop]: Abstraction has 6491 states and 8792 transitions. [2025-03-03 15:08:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 8792 transitions. [2025-03-03 15:08:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:21,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:21,727 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1658532426, now seen corresponding path program 1 times [2025-03-03 15:08:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878108403] [2025-03-03 15:08:21,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:21,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:21,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,760 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-03 15:08:21,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878108403] [2025-03-03 15:08:21,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878108403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796226115] [2025-03-03 15:08:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,762 INFO L87 Difference]: Start difference. First operand 6491 states and 8792 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,812 INFO L93 Difference]: Finished difference Result 11907 states and 16286 transitions. [2025-03-03 15:08:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,818 INFO L225 Difference]: With dead ends: 11907 [2025-03-03 15:08:21,818 INFO L226 Difference]: Without dead ends: 7944 [2025-03-03 15:08:21,822 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-03 15:08:21,822 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 433 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2025-03-03 15:08:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 6080. [2025-03-03 15:08:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6080 states, 6078 states have (on average 1.3583415597235933) internal successors, (8256), 6079 states have internal predecessors, (8256), 0 states have call successors, (0), 0 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-03 15:08:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 8256 transitions. [2025-03-03 15:08:21,876 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 8256 transitions. Word has length 74 [2025-03-03 15:08:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,876 INFO L471 AbstractCegarLoop]: Abstraction has 6080 states and 8256 transitions. [2025-03-03 15:08:21,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 8256 transitions. [2025-03-03 15:08:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:21,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,879 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] [2025-03-03 15:08:21,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:21,879 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 74246388, now seen corresponding path program 1 times [2025-03-03 15:08:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116706231] [2025-03-03 15:08:21,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:21,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:21,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:22,017 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-03 15:08:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116706231] [2025-03-03 15:08:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116706231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:22,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735107130] [2025-03-03 15:08:22,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:22,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:22,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:22,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:22,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:22,019 INFO L87 Difference]: Start difference. First operand 6080 states and 8256 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,563 INFO L93 Difference]: Finished difference Result 13543 states and 18638 transitions. [2025-03-03 15:08:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,574 INFO L225 Difference]: With dead ends: 13543 [2025-03-03 15:08:22,574 INFO L226 Difference]: Without dead ends: 12621 [2025-03-03 15:08:22,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:22,578 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1752 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1629 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2025-03-03 15:08:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 6057. [2025-03-03 15:08:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6057 states, 6055 states have (on average 1.3585466556564822) internal successors, (8226), 6056 states have internal predecessors, (8226), 0 states have call successors, (0), 0 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-03 15:08:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6057 states to 6057 states and 8226 transitions. [2025-03-03 15:08:22,675 INFO L78 Accepts]: Start accepts. Automaton has 6057 states and 8226 transitions. Word has length 75 [2025-03-03 15:08:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:22,675 INFO L471 AbstractCegarLoop]: Abstraction has 6057 states and 8226 transitions. [2025-03-03 15:08:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 6057 states and 8226 transitions. [2025-03-03 15:08:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:22,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:22,678 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] [2025-03-03 15:08:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:22,679 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:22,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -37610530, now seen corresponding path program 1 times [2025-03-03 15:08:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513894123] [2025-03-03 15:08:22,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:22,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:22,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:22,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:22,894 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-03 15:08:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513894123] [2025-03-03 15:08:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513894123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:22,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743150458] [2025-03-03 15:08:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:22,896 INFO L87 Difference]: Start difference. First operand 6057 states and 8226 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:23,486 INFO L93 Difference]: Finished difference Result 9764 states and 13342 transitions. [2025-03-03 15:08:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:23,495 INFO L225 Difference]: With dead ends: 9764 [2025-03-03 15:08:23,495 INFO L226 Difference]: Without dead ends: 9459 [2025-03-03 15:08:23,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:23,498 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2106 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2106 Valid, 1616 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9459 states. [2025-03-03 15:08:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9459 to 6057. [2025-03-03 15:08:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6057 states, 6055 states have (on average 1.3583815028901733) internal successors, (8225), 6056 states have internal predecessors, (8225), 0 states have call successors, (0), 0 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-03 15:08:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6057 states to 6057 states and 8225 transitions. [2025-03-03 15:08:23,558 INFO L78 Accepts]: Start accepts. Automaton has 6057 states and 8225 transitions. Word has length 75 [2025-03-03 15:08:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 6057 states and 8225 transitions. [2025-03-03 15:08:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6057 states and 8225 transitions. [2025-03-03 15:08:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:23,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:23,561 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] [2025-03-03 15:08:23,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:23,562 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -691809354, now seen corresponding path program 1 times [2025-03-03 15:08:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432751293] [2025-03-03 15:08:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:23,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:23,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,701 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-03 15:08:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432751293] [2025-03-03 15:08:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432751293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008915110] [2025-03-03 15:08:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:23,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:23,702 INFO L87 Difference]: Start difference. First operand 6057 states and 8225 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,170 INFO L93 Difference]: Finished difference Result 12881 states and 17717 transitions. [2025-03-03 15:08:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,179 INFO L225 Difference]: With dead ends: 12881 [2025-03-03 15:08:24,179 INFO L226 Difference]: Without dead ends: 12573 [2025-03-03 15:08:24,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:24,180 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2176 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 1507 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12573 states. [2025-03-03 15:08:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12573 to 6053. [2025-03-03 15:08:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 6051 states have (on average 1.3584531482399604) internal successors, (8220), 6052 states have internal predecessors, (8220), 0 states have call successors, (0), 0 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-03 15:08:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 8220 transitions. [2025-03-03 15:08:24,243 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 8220 transitions. Word has length 75 [2025-03-03 15:08:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 6053 states and 8220 transitions. [2025-03-03 15:08:24,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 8220 transitions. [2025-03-03 15:08:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:24,246 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] [2025-03-03 15:08:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:24,247 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1418128974, now seen corresponding path program 1 times [2025-03-03 15:08:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723769031] [2025-03-03 15:08:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:24,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:24,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:24,281 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-03 15:08:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723769031] [2025-03-03 15:08:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723769031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357884862] [2025-03-03 15:08:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:24,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:24,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:24,283 INFO L87 Difference]: Start difference. First operand 6053 states and 8220 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,325 INFO L93 Difference]: Finished difference Result 7977 states and 10861 transitions. [2025-03-03 15:08:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:24,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,329 INFO L225 Difference]: With dead ends: 7977 [2025-03-03 15:08:24,329 INFO L226 Difference]: Without dead ends: 5092 [2025-03-03 15:08:24,331 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-03 15:08:24,332 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 305 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 894 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2025-03-03 15:08:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 3989. [2025-03-03 15:08:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3989 states, 3987 states have (on average 1.328567845497868) internal successors, (5297), 3988 states have internal predecessors, (5297), 0 states have call successors, (0), 0 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-03 15:08:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3989 states to 3989 states and 5297 transitions. [2025-03-03 15:08:24,358 INFO L78 Accepts]: Start accepts. Automaton has 3989 states and 5297 transitions. Word has length 75 [2025-03-03 15:08:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 3989 states and 5297 transitions. [2025-03-03 15:08:24,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-03 15:08:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3989 states and 5297 transitions. [2025-03-03 15:08:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:24,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:24,360 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] [2025-03-03 15:08:24,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:08:24,361 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:24,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash -369639886, now seen corresponding path program 1 times [2025-03-03 15:08:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063684825] [2025-03-03 15:08:24,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:24,718 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-03 15:08:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063684825] [2025-03-03 15:08:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063684825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:08:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385304713] [2025-03-03 15:08:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:24,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:08:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:08:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:24,719 INFO L87 Difference]: Start difference. First operand 3989 states and 5297 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-03 15:08:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:25,410 INFO L93 Difference]: Finished difference Result 12168 states and 16480 transitions. [2025-03-03 15:08:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:08:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:25,418 INFO L225 Difference]: With dead ends: 12168 [2025-03-03 15:08:25,418 INFO L226 Difference]: Without dead ends: 12076 [2025-03-03 15:08:25,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:08:25,421 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 3038 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3038 SdHoareTripleChecker+Valid, 4296 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:25,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3038 Valid, 4296 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12076 states. [2025-03-03 15:08:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12076 to 3961. [2025-03-03 15:08:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3960 states have (on average 1.3280303030303031) internal successors, (5259), 3960 states have internal predecessors, (5259), 0 states have call successors, (0), 0 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-03 15:08:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5259 transitions. [2025-03-03 15:08:25,470 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5259 transitions. Word has length 77 [2025-03-03 15:08:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:25,471 INFO L471 AbstractCegarLoop]: Abstraction has 3961 states and 5259 transitions. [2025-03-03 15:08:25,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-03 15:08:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5259 transitions. [2025-03-03 15:08:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:25,473 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] [2025-03-03 15:08:25,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:08:25,473 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:25,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2053971281, now seen corresponding path program 1 times [2025-03-03 15:08:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493707879] [2025-03-03 15:08:25,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:25,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:25,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:25,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,841 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-03 15:08:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493707879] [2025-03-03 15:08:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493707879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:08:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433999909] [2025-03-03 15:08:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:08:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:08:25,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:25,842 INFO L87 Difference]: Start difference. First operand 3961 states and 5259 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-03 15:08:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,494 INFO L93 Difference]: Finished difference Result 12562 states and 17041 transitions. [2025-03-03 15:08:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:08:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:08:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,504 INFO L225 Difference]: With dead ends: 12562 [2025-03-03 15:08:26,504 INFO L226 Difference]: Without dead ends: 11979 [2025-03-03 15:08:26,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:08:26,508 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 2360 mSDsluCounter, 3779 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2360 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2360 Valid, 4197 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11979 states. [2025-03-03 15:08:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11979 to 3896. [2025-03-03 15:08:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3896 states, 3895 states have (on average 1.330423620025674) internal successors, (5182), 3895 states have internal predecessors, (5182), 0 states have call successors, (0), 0 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-03 15:08:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 5182 transitions. [2025-03-03 15:08:26,575 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 5182 transitions. Word has length 78 [2025-03-03 15:08:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:26,575 INFO L471 AbstractCegarLoop]: Abstraction has 3896 states and 5182 transitions. [2025-03-03 15:08:26,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-03 15:08:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 5182 transitions. [2025-03-03 15:08:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:26,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:26,577 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] [2025-03-03 15:08:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:08:26,577 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 731478128, now seen corresponding path program 1 times [2025-03-03 15:08:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73440747] [2025-03-03 15:08:26,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:26,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:26,902 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-03 15:08:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73440747] [2025-03-03 15:08:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73440747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531132427] [2025-03-03 15:08:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:26,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:26,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:26,907 INFO L87 Difference]: Start difference. First operand 3896 states and 5182 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-03 15:08:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:27,408 INFO L93 Difference]: Finished difference Result 11151 states and 15056 transitions. [2025-03-03 15:08:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:08:27,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:08:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:27,417 INFO L225 Difference]: With dead ends: 11151 [2025-03-03 15:08:27,418 INFO L226 Difference]: Without dead ends: 11055 [2025-03-03 15:08:27,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:27,420 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 2762 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:27,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 2507 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2025-03-03 15:08:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 3864. [2025-03-03 15:08:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3863 states have (on average 1.3308309603934765) internal successors, (5141), 3863 states have internal predecessors, (5141), 0 states have call successors, (0), 0 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-03 15:08:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5141 transitions. [2025-03-03 15:08:27,466 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5141 transitions. Word has length 78 [2025-03-03 15:08:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 3864 states and 5141 transitions. [2025-03-03 15:08:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-03 15:08:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5141 transitions. [2025-03-03 15:08:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:08:27,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,469 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] [2025-03-03 15:08:27,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:08:27,469 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 873964335, now seen corresponding path program 1 times [2025-03-03 15:08:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248422505] [2025-03-03 15:08:27,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:08:27,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:08:27,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,548 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-03 15:08:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248422505] [2025-03-03 15:08:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248422505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789989873] [2025-03-03 15:08:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:27,553 INFO L87 Difference]: Start difference. First operand 3864 states and 5141 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-03 15:08:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:27,649 INFO L93 Difference]: Finished difference Result 11101 states and 15235 transitions. [2025-03-03 15:08:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:08:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:27,658 INFO L225 Difference]: With dead ends: 11101 [2025-03-03 15:08:27,658 INFO L226 Difference]: Without dead ends: 8291 [2025-03-03 15:08:27,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:27,661 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1793 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:27,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 1103 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2025-03-03 15:08:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 6308. [2025-03-03 15:08:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 6307 states have (on average 1.33882987157127) internal successors, (8444), 6307 states have internal predecessors, (8444), 0 states have call successors, (0), 0 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-03 15:08:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8444 transitions. [2025-03-03 15:08:27,720 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8444 transitions. Word has length 82 [2025-03-03 15:08:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 6308 states and 8444 transitions. [2025-03-03 15:08:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-03 15:08:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8444 transitions. [2025-03-03 15:08:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:08:27,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,725 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] [2025-03-03 15:08:27,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:08:27,725 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1352675096, now seen corresponding path program 1 times [2025-03-03 15:08:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57467411] [2025-03-03 15:08:27,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:27,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:27,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,798 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-03 15:08:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57467411] [2025-03-03 15:08:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57467411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:27,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:27,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069822052] [2025-03-03 15:08:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:27,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:27,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:27,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:27,799 INFO L87 Difference]: Start difference. First operand 6308 states and 8444 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-03 15:08:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:27,870 INFO L93 Difference]: Finished difference Result 6316 states and 8448 transitions. [2025-03-03 15:08:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 15:08:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:27,874 INFO L225 Difference]: With dead ends: 6316 [2025-03-03 15:08:27,874 INFO L226 Difference]: Without dead ends: 5881 [2025-03-03 15:08:27,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:27,875 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1256 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:27,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1080 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2025-03-03 15:08:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5875. [2025-03-03 15:08:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5875 states, 5874 states have (on average 1.3411644535240042) internal successors, (7878), 5874 states have internal predecessors, (7878), 0 states have call successors, (0), 0 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-03 15:08:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5875 states to 5875 states and 7878 transitions. [2025-03-03 15:08:27,929 INFO L78 Accepts]: Start accepts. Automaton has 5875 states and 7878 transitions. Word has length 83 [2025-03-03 15:08:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,929 INFO L471 AbstractCegarLoop]: Abstraction has 5875 states and 7878 transitions. [2025-03-03 15:08:27,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-03 15:08:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5875 states and 7878 transitions. [2025-03-03 15:08:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:08:27,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:08:27,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:08:27,933 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash -708517958, now seen corresponding path program 1 times [2025-03-03 15:08:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796381046] [2025-03-03 15:08:27,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:08:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:08:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,006 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-03 15:08:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796381046] [2025-03-03 15:08:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796381046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779568212] [2025-03-03 15:08:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:28,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:28,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:28,007 INFO L87 Difference]: Start difference. First operand 5875 states and 7878 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-03 15:08:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,060 INFO L93 Difference]: Finished difference Result 15335 states and 20856 transitions. [2025-03-03 15:08:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:08:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,068 INFO L225 Difference]: With dead ends: 15335 [2025-03-03 15:08:28,068 INFO L226 Difference]: Without dead ends: 10445 [2025-03-03 15:08:28,072 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-03 15:08:28,072 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 158 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 763 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2025-03-03 15:08:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 9947. [2025-03-03 15:08:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9947 states, 9946 states have (on average 1.348883973456666) internal successors, (13416), 9946 states have internal predecessors, (13416), 0 states have call successors, (0), 0 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-03 15:08:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9947 states to 9947 states and 13416 transitions. [2025-03-03 15:08:28,157 INFO L78 Accepts]: Start accepts. Automaton has 9947 states and 13416 transitions. Word has length 84 [2025-03-03 15:08:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:28,157 INFO L471 AbstractCegarLoop]: Abstraction has 9947 states and 13416 transitions. [2025-03-03 15:08:28,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-03 15:08:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9947 states and 13416 transitions. [2025-03-03 15:08:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:08:28,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:28,160 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] [2025-03-03 15:08:28,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:08:28,160 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1760820198, now seen corresponding path program 1 times [2025-03-03 15:08:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069840683] [2025-03-03 15:08:28,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:08:28,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:08:28,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,236 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-03 15:08:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069840683] [2025-03-03 15:08:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069840683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79615746] [2025-03-03 15:08:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:28,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:28,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:28,237 INFO L87 Difference]: Start difference. First operand 9947 states and 13416 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-03 15:08:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,301 INFO L93 Difference]: Finished difference Result 27231 states and 36986 transitions. [2025-03-03 15:08:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:08:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,318 INFO L225 Difference]: With dead ends: 27231 [2025-03-03 15:08:28,318 INFO L226 Difference]: Without dead ends: 18269 [2025-03-03 15:08:28,327 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-03 15:08:28,329 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 136 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 756 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18269 states. [2025-03-03 15:08:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18269 to 17275. [2025-03-03 15:08:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17275 states, 17274 states have (on average 1.348847979622554) internal successors, (23300), 17274 states have internal predecessors, (23300), 0 states have call successors, (0), 0 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-03 15:08:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17275 states to 17275 states and 23300 transitions. [2025-03-03 15:08:28,475 INFO L78 Accepts]: Start accepts. Automaton has 17275 states and 23300 transitions. Word has length 85 [2025-03-03 15:08:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:28,476 INFO L471 AbstractCegarLoop]: Abstraction has 17275 states and 23300 transitions. [2025-03-03 15:08:28,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-03 15:08:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 17275 states and 23300 transitions. [2025-03-03 15:08:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:08:28,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:28,479 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] [2025-03-03 15:08:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:08:28,479 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:28,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1872530014, now seen corresponding path program 1 times [2025-03-03 15:08:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869902346] [2025-03-03 15:08:28,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:28,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:08:28,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:08:28,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,572 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-03 15:08:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869902346] [2025-03-03 15:08:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869902346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962545736] [2025-03-03 15:08:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:28,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:28,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:28,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:28,573 INFO L87 Difference]: Start difference. First operand 17275 states and 23300 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-03 15:08:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,671 INFO L93 Difference]: Finished difference Result 48575 states and 65670 transitions. [2025-03-03 15:08:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 15:08:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,703 INFO L225 Difference]: With dead ends: 48575 [2025-03-03 15:08:28,703 INFO L226 Difference]: Without dead ends: 32285 [2025-03-03 15:08:28,719 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-03 15:08:28,723 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 103 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 753 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32285 states. [2025-03-03 15:08:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32285 to 30299. [2025-03-03 15:08:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30299 states, 30298 states have (on average 1.3427949039540563) internal successors, (40684), 30298 states have internal predecessors, (40684), 0 states have call successors, (0), 0 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-03 15:08:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30299 states to 30299 states and 40684 transitions. [2025-03-03 15:08:29,035 INFO L78 Accepts]: Start accepts. Automaton has 30299 states and 40684 transitions. Word has length 88 [2025-03-03 15:08:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 30299 states and 40684 transitions. [2025-03-03 15:08:29,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-03 15:08:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30299 states and 40684 transitions. [2025-03-03 15:08:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:08:29,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:29,039 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] [2025-03-03 15:08:29,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:08:29,039 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -88363062, now seen corresponding path program 1 times [2025-03-03 15:08:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739987565] [2025-03-03 15:08:29,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:29,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:08:29,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:08:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,261 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-03 15:08:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:29,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739987565] [2025-03-03 15:08:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739987565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405768746] [2025-03-03 15:08:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:29,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:29,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:29,263 INFO L87 Difference]: Start difference. First operand 30299 states and 40684 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-03 15:08:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:29,360 INFO L93 Difference]: Finished difference Result 32509 states and 43629 transitions. [2025-03-03 15:08:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:08:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:29,399 INFO L225 Difference]: With dead ends: 32509 [2025-03-03 15:08:29,399 INFO L226 Difference]: Without dead ends: 32507 [2025-03-03 15:08:29,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:29,412 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 0 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:29,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32507 states. [2025-03-03 15:08:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32507 to 32507. [2025-03-03 15:08:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32507 states, 32506 states have (on average 1.3195102442625977) internal successors, (42892), 32506 states have internal predecessors, (42892), 0 states have call successors, (0), 0 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-03 15:08:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32507 states to 32507 states and 42892 transitions. [2025-03-03 15:08:29,839 INFO L78 Accepts]: Start accepts. Automaton has 32507 states and 42892 transitions. Word has length 89 [2025-03-03 15:08:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 32507 states and 42892 transitions. [2025-03-03 15:08:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-03 15:08:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32507 states and 42892 transitions. [2025-03-03 15:08:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:08:29,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:29,843 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] [2025-03-03 15:08:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:08:29,844 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:29,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1703507549, now seen corresponding path program 1 times [2025-03-03 15:08:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167110678] [2025-03-03 15:08:29,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:29,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:08:29,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:08:29,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:29,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,896 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-03 15:08:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167110678] [2025-03-03 15:08:29,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167110678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:29,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:29,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:29,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120863222] [2025-03-03 15:08:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:29,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:29,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:29,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:29,897 INFO L87 Difference]: Start difference. First operand 32507 states and 42892 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:30,134 INFO L93 Difference]: Finished difference Result 89535 states and 118030 transitions. [2025-03-03 15:08:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:30,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:08:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:30,195 INFO L225 Difference]: With dead ends: 89535 [2025-03-03 15:08:30,195 INFO L226 Difference]: Without dead ends: 58013 [2025-03-03 15:08:30,218 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-03 15:08:30,218 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 264 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:30,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 565 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58013 states. [2025-03-03 15:08:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58013 to 57275. [2025-03-03 15:08:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57275 states, 57274 states have (on average 1.2933617348185913) internal successors, (74076), 57274 states have internal predecessors, (74076), 0 states have call successors, (0), 0 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-03 15:08:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57275 states to 57275 states and 74076 transitions. [2025-03-03 15:08:30,889 INFO L78 Accepts]: Start accepts. Automaton has 57275 states and 74076 transitions. Word has length 90 [2025-03-03 15:08:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:30,889 INFO L471 AbstractCegarLoop]: Abstraction has 57275 states and 74076 transitions. [2025-03-03 15:08:30,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 57275 states and 74076 transitions. [2025-03-03 15:08:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:08:30,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:30,894 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] [2025-03-03 15:08:30,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:08:30,894 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:30,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 951390296, now seen corresponding path program 1 times [2025-03-03 15:08:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322662371] [2025-03-03 15:08:30,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:08:30,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:08:30,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:30,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:30,957 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-03 15:08:30,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322662371] [2025-03-03 15:08:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322662371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:30,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158938385] [2025-03-03 15:08:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:30,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:30,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:30,959 INFO L87 Difference]: Start difference. First operand 57275 states and 74076 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-03 15:08:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:31,209 INFO L93 Difference]: Finished difference Result 146319 states and 188814 transitions. [2025-03-03 15:08:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:08:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:31,298 INFO L225 Difference]: With dead ends: 146319 [2025-03-03 15:08:31,298 INFO L226 Difference]: Without dead ends: 90029 [2025-03-03 15:08:31,341 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-03 15:08:31,341 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 169 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:31,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90029 states. [2025-03-03 15:08:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90029 to 83627. [2025-03-03 15:08:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83627 states, 83626 states have (on average 1.2812761581326382) internal successors, (107148), 83626 states have internal predecessors, (107148), 0 states have call successors, (0), 0 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-03 15:08:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83627 states to 83627 states and 107148 transitions. [2025-03-03 15:08:32,481 INFO L78 Accepts]: Start accepts. Automaton has 83627 states and 107148 transitions. Word has length 92 [2025-03-03 15:08:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 83627 states and 107148 transitions. [2025-03-03 15:08:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-03 15:08:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 83627 states and 107148 transitions. [2025-03-03 15:08:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:08:32,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:32,484 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] [2025-03-03 15:08:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:08:32,485 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1165549780, now seen corresponding path program 1 times [2025-03-03 15:08:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766528448] [2025-03-03 15:08:32,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:32,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:08:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:08:32,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:32,578 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-03 15:08:32,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766528448] [2025-03-03 15:08:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766528448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:32,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816711807] [2025-03-03 15:08:32,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:32,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:32,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:32,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:32,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:32,579 INFO L87 Difference]: Start difference. First operand 83627 states and 107148 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-03 15:08:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:33,057 INFO L93 Difference]: Finished difference Result 134405 states and 173217 transitions. [2025-03-03 15:08:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:08:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:33,181 INFO L225 Difference]: With dead ends: 134405 [2025-03-03 15:08:33,182 INFO L226 Difference]: Without dead ends: 117339 [2025-03-03 15:08:33,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:33,218 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 1376 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:33,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1317 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117339 states. [2025-03-03 15:08:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117339 to 96739. [2025-03-03 15:08:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96739 states, 96738 states have (on average 1.2794558498211666) internal successors, (123772), 96738 states have internal predecessors, (123772), 0 states have call successors, (0), 0 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-03 15:08:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96739 states to 96739 states and 123772 transitions. [2025-03-03 15:08:34,256 INFO L78 Accepts]: Start accepts. Automaton has 96739 states and 123772 transitions. Word has length 92 [2025-03-03 15:08:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:34,256 INFO L471 AbstractCegarLoop]: Abstraction has 96739 states and 123772 transitions. [2025-03-03 15:08:34,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-03 15:08:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 96739 states and 123772 transitions. [2025-03-03 15:08:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:08:34,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:34,259 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] [2025-03-03 15:08:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:08:34,260 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1120145489, now seen corresponding path program 1 times [2025-03-03 15:08:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203217001] [2025-03-03 15:08:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:34,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:08:34,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:08:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:34,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:34,323 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-03 15:08:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203217001] [2025-03-03 15:08:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203217001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245624791] [2025-03-03 15:08:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:34,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:34,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:34,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:34,324 INFO L87 Difference]: Start difference. First operand 96739 states and 123772 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:34,763 INFO L93 Difference]: Finished difference Result 139829 states and 179841 transitions. [2025-03-03 15:08:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 15:08:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:34,895 INFO L225 Difference]: With dead ends: 139829 [2025-03-03 15:08:34,895 INFO L226 Difference]: Without dead ends: 122763 [2025-03-03 15:08:34,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:34,936 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1375 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1313 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122763 states. [2025-03-03 15:08:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122763 to 109851. [2025-03-03 15:08:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109851 states, 109850 states have (on average 1.2780700955848885) internal successors, (140396), 109850 states have internal predecessors, (140396), 0 states have call successors, (0), 0 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-03 15:08:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109851 states to 109851 states and 140396 transitions. [2025-03-03 15:08:36,579 INFO L78 Accepts]: Start accepts. Automaton has 109851 states and 140396 transitions. Word has length 93 [2025-03-03 15:08:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,579 INFO L471 AbstractCegarLoop]: Abstraction has 109851 states and 140396 transitions. [2025-03-03 15:08:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109851 states and 140396 transitions. [2025-03-03 15:08:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:08:36,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,584 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] [2025-03-03 15:08:36,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:08:36,584 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:36,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -518351238, now seen corresponding path program 1 times [2025-03-03 15:08:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299938009] [2025-03-03 15:08:36,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:08:36,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:08:36,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,895 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-03 15:08:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299938009] [2025-03-03 15:08:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299938009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237602773] [2025-03-03 15:08:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:36,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:36,897 INFO L87 Difference]: Start difference. First operand 109851 states and 140396 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-03 15:08:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,463 INFO L93 Difference]: Finished difference Result 162773 states and 209265 transitions. [2025-03-03 15:08:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 15:08:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,615 INFO L225 Difference]: With dead ends: 162773 [2025-03-03 15:08:37,615 INFO L226 Difference]: Without dead ends: 136851 [2025-03-03 15:08:37,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:37,640 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1398 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1254 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136851 states. [2025-03-03 15:08:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136851 to 127779. [2025-03-03 15:08:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127779 states, 127778 states have (on average 1.2762447369656749) internal successors, (163076), 127778 states have internal predecessors, (163076), 0 states have call successors, (0), 0 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-03 15:08:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127779 states to 127779 states and 163076 transitions. [2025-03-03 15:08:39,000 INFO L78 Accepts]: Start accepts. Automaton has 127779 states and 163076 transitions. Word has length 99 [2025-03-03 15:08:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 127779 states and 163076 transitions. [2025-03-03 15:08:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-03 15:08:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 127779 states and 163076 transitions. [2025-03-03 15:08:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:08:39,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:39,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:08:39,016 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -341480426, now seen corresponding path program 1 times [2025-03-03 15:08:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566740880] [2025-03-03 15:08:39,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:39,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:08:39,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:08:39,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566740880] [2025-03-03 15:08:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566740880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800499873] [2025-03-03 15:08:39,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:39,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:39,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:39,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:08:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:08:39,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:08:39,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:08:39,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800499873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:39,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:08:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126908526] [2025-03-03 15:08:39,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:39,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:08:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:39,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:08:39,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:39,959 INFO L87 Difference]: Start difference. First operand 127779 states and 163076 transitions. Second operand has 14 states, 14 states have (on average 21.571428571428573) internal successors, (302), 14 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-03 15:08:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,995 INFO L93 Difference]: Finished difference Result 270207 states and 345022 transitions. [2025-03-03 15:08:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.571428571428573) internal successors, (302), 14 states have internal predecessors, (302), 0 states have call successors, (0), 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 114 [2025-03-03 15:08:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:41,176 INFO L225 Difference]: With dead ends: 270207 [2025-03-03 15:08:41,176 INFO L226 Difference]: Without dead ends: 143413 [2025-03-03 15:08:41,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:41,241 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 2792 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:41,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 1381 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143413 states. [2025-03-03 15:08:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143413 to 124219. [2025-03-03 15:08:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124219 states, 124218 states have (on average 1.2542787679724356) internal successors, (155804), 124218 states have internal predecessors, (155804), 0 states have call successors, (0), 0 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-03 15:08:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124219 states to 124219 states and 155804 transitions. [2025-03-03 15:08:42,780 INFO L78 Accepts]: Start accepts. Automaton has 124219 states and 155804 transitions. Word has length 114 [2025-03-03 15:08:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 124219 states and 155804 transitions. [2025-03-03 15:08:42,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.571428571428573) internal successors, (302), 14 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-03 15:08:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 124219 states and 155804 transitions. [2025-03-03 15:08:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:08:42,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:42,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:42,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:08:42,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-03 15:08:42,996 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:42,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1680468189, now seen corresponding path program 1 times [2025-03-03 15:08:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:42,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342473452] [2025-03-03 15:08:42,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:08:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342473452] [2025-03-03 15:08:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342473452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34100415] [2025-03-03 15:08:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:43,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:43,404 INFO L87 Difference]: Start difference. First operand 124219 states and 155804 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-03 15:08:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:44,415 INFO L93 Difference]: Finished difference Result 246983 states and 309630 transitions. [2025-03-03 15:08:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2025-03-03 15:08:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:44,619 INFO L225 Difference]: With dead ends: 246983 [2025-03-03 15:08:44,619 INFO L226 Difference]: Without dead ends: 186957 [2025-03-03 15:08:44,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:44,645 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1559 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:44,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 996 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186957 states. [2025-03-03 15:08:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186957 to 124195. [2025-03-03 15:08:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124195 states, 124194 states have (on average 1.254231283314814) internal successors, (155768), 124194 states have internal predecessors, (155768), 0 states have call successors, (0), 0 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-03 15:08:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124195 states to 124195 states and 155768 transitions. [2025-03-03 15:08:46,184 INFO L78 Accepts]: Start accepts. Automaton has 124195 states and 155768 transitions. Word has length 115 [2025-03-03 15:08:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:46,184 INFO L471 AbstractCegarLoop]: Abstraction has 124195 states and 155768 transitions. [2025-03-03 15:08:46,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-03 15:08:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 124195 states and 155768 transitions. [2025-03-03 15:08:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:08:46,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:46,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:08:46,199 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -559025074, now seen corresponding path program 1 times [2025-03-03 15:08:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400301977] [2025-03-03 15:08:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:46,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:46,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:46,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:46,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:08:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:46,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400301977] [2025-03-03 15:08:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400301977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532774982] [2025-03-03 15:08:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:46,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:46,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:46,654 INFO L87 Difference]: Start difference. First operand 124195 states and 155768 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-03 15:08:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,449 INFO L93 Difference]: Finished difference Result 243826 states and 305178 transitions. [2025-03-03 15:08:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2025-03-03 15:08:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:47,686 INFO L225 Difference]: With dead ends: 243826 [2025-03-03 15:08:47,686 INFO L226 Difference]: Without dead ends: 196996 [2025-03-03 15:08:47,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:47,762 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1673 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:47,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1218 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196996 states. [2025-03-03 15:08:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196996 to 124143. [2025-03-03 15:08:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124143 states, 124142 states have (on average 1.2542088898197226) internal successors, (155700), 124142 states have internal predecessors, (155700), 0 states have call successors, (0), 0 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-03 15:08:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124143 states to 124143 states and 155700 transitions. [2025-03-03 15:08:49,698 INFO L78 Accepts]: Start accepts. Automaton has 124143 states and 155700 transitions. Word has length 115 [2025-03-03 15:08:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,698 INFO L471 AbstractCegarLoop]: Abstraction has 124143 states and 155700 transitions. [2025-03-03 15:08:49,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-03 15:08:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 124143 states and 155700 transitions. [2025-03-03 15:08:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:08:49,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:49,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:08:49,716 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:49,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1832683394, now seen corresponding path program 1 times [2025-03-03 15:08:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187436900] [2025-03-03 15:08:49,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:08:49,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:08:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187436900] [2025-03-03 15:08:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187436900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528860321] [2025-03-03 15:08:49,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:49,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:49,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:49,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:08:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:08:50,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:08:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:08:50,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:51,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528860321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:52,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-03 15:08:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217013835] [2025-03-03 15:08:52,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:08:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:08:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:08:52,159 INFO L87 Difference]: Start difference. First operand 124143 states and 155700 transitions. Second operand has 30 states, 30 states have (on average 10.1) internal successors, (303), 29 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-03 15:09:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:01,578 INFO L93 Difference]: Finished difference Result 837435 states and 1043958 transitions. [2025-03-03 15:09:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-03 15:09:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 10.1) internal successors, (303), 29 states have internal predecessors, (303), 0 states have call successors, (0), 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 116 [2025-03-03 15:09:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:02,830 INFO L225 Difference]: With dead ends: 837435 [2025-03-03 15:09:02,830 INFO L226 Difference]: Without dead ends: 777457 [2025-03-03 15:09:03,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12350 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5936, Invalid=26284, Unknown=0, NotChecked=0, Total=32220 [2025-03-03 15:09:03,099 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 5718 mSDsluCounter, 6337 mSDsCounter, 0 mSdLazyCounter, 5917 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5718 SdHoareTripleChecker+Valid, 6850 SdHoareTripleChecker+Invalid, 6077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 5917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:03,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5718 Valid, 6850 Invalid, 6077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 5917 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 15:09:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777457 states.