./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:19:22,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:19:22,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:19:22,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:19:22,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:19:22,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:19:22,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:19:22,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:19:22,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:19:22,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:19:22,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:19:22,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:19:22,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:19:22,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:19:22,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:19:22,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:19:22,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:19:22,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:19:22,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:19:22,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:19:22,622 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 -> 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f [2025-03-08 06:19:22,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:19:22,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:19:22,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:19:22,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:19:22,845 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:19:22,845 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.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-08 06:19:24,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85635e02/d04c742e224d4e4fa6b1aae4aa7fd6bb/FLAG4922d49c6 [2025-03-08 06:19:24,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:19:24,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-08 06:19:24,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85635e02/d04c742e224d4e4fa6b1aae4aa7fd6bb/FLAG4922d49c6 [2025-03-08 06:19:24,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85635e02/d04c742e224d4e4fa6b1aae4aa7fd6bb [2025-03-08 06:19:24,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:19:24,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:19:24,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:19:24,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:19:24,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:19:24,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24, skipping insertion in model container [2025-03-08 06:19:24,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:19:24,547 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.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2025-03-08 06:19:24,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:19:24,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:19:24,648 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.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2025-03-08 06:19:24,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:19:24,692 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:19:24,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24 WrapperNode [2025-03-08 06:19:24,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:19:24,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:19:24,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:19:24,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:19:24,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,734 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 736 [2025-03-08 06:19:24,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:19:24,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:19:24,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:19:24,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:19:24,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,756 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:19:24,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:19:24,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:19:24,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:19:24,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:19:24,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (1/1) ... [2025-03-08 06:19:24,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:19:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:19:24,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:19:24,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:19:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:19:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:19:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:19:24,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:19:24,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:19:24,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:19:25,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~2#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: havoc main_~node3__m3~2#1; [2025-03-08 06:19:25,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:19:25,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: havoc main_~node4__m4~2#1; [2025-03-08 06:19:25,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1120: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:19:25,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L662: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:19:25,416 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-08 06:19:25,416 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:19:25,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:19:25,427 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:19:25,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:19:25 BoogieIcfgContainer [2025-03-08 06:19:25,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:19:25,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:19:25,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:19:25,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:19:25,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:19:24" (1/3) ... [2025-03-08 06:19:25,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793aa0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:19:25, skipping insertion in model container [2025-03-08 06:19:25,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:24" (2/3) ... [2025-03-08 06:19:25,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793aa0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:19:25, skipping insertion in model container [2025-03-08 06:19:25,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:19:25" (3/3) ... [2025-03-08 06:19:25,434 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-08 06:19:25,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:19:25,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 180 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:19:25,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:19:25,489 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;@2caebf86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:19:25,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:19:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:19:25,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:25,498 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-08 06:19:25,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1757487568, now seen corresponding path program 1 times [2025-03-08 06:19:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:25,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-03-08 06:19:25,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:25,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:19:25,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:19:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:26,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-08 06:19:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:26,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-03-08 06:19:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670249202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:26,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:26,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325482] [2025-03-08 06:19:26,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:26,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:26,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:26,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:26,024 INFO L87 Difference]: Start difference. First operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-08 06:19:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:26,188 INFO L93 Difference]: Finished difference Result 640 states and 1036 transitions. [2025-03-08 06:19:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-08 06:19:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:26,205 INFO L225 Difference]: With dead ends: 640 [2025-03-08 06:19:26,205 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 06:19:26,210 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-08 06:19:26,212 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1465 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:26,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 1395 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 06:19:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 275. [2025-03-08 06:19:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2025-03-08 06:19:26,259 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 65 [2025-03-08 06:19:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:26,259 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-03-08 06:19:26,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-08 06:19:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2025-03-08 06:19:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:19:26,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:26,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] [2025-03-08 06:19:26,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:19:26,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:26,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1351499395, now seen corresponding path program 1 times [2025-03-08 06:19:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:26,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285066310] [2025-03-08 06:19:26,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:19:26,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:19:26,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285066310] [2025-03-08 06:19:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285066310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:26,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051527621] [2025-03-08 06:19:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:26,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:26,506 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 6 states, 6 states have (on average 11.0) 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-08 06:19:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:26,631 INFO L93 Difference]: Finished difference Result 1013 states and 1556 transitions. [2025-03-08 06:19:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) 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-08 06:19:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:26,636 INFO L225 Difference]: With dead ends: 1013 [2025-03-08 06:19:26,636 INFO L226 Difference]: Without dead ends: 801 [2025-03-08 06:19:26,638 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-08 06:19:26,639 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1687 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:26,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 702 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-08 06:19:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 795. [2025-03-08 06:19:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1211 transitions. [2025-03-08 06:19:26,674 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1211 transitions. Word has length 66 [2025-03-08 06:19:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1211 transitions. [2025-03-08 06:19:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) 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-08 06:19:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1211 transitions. [2025-03-08 06:19:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:19:26,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:26,676 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-08 06:19:26,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:19:26,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:26,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:26,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1014158194, now seen corresponding path program 1 times [2025-03-08 06:19:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:26,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-08 06:19:26,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:26,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:26,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:19:26,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:19:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-08 06:19:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046919848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:19:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636364924] [2025-03-08 06:19:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:19:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:26,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:19:26,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:26,870 INFO L87 Difference]: Start difference. First operand 795 states and 1211 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-08 06:19:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:27,066 INFO L93 Difference]: Finished difference Result 2017 states and 3117 transitions. [2025-03-08 06:19:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:19:27,066 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-08 06:19:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:27,073 INFO L225 Difference]: With dead ends: 2017 [2025-03-08 06:19:27,074 INFO L226 Difference]: Without dead ends: 1323 [2025-03-08 06:19:27,077 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-08 06:19:27,077 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 930 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:27,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 250 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-03-08 06:19:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-03-08 06:19:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.5340909090909092) internal successors, (2025), 1320 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2025 transitions. [2025-03-08 06:19:27,111 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2025 transitions. Word has length 67 [2025-03-08 06:19:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:27,111 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 2025 transitions. [2025-03-08 06:19:27,111 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-08 06:19:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2025 transitions. [2025-03-08 06:19:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:19:27,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:27,113 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-08 06:19:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:19:27,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2042450118, now seen corresponding path program 1 times [2025-03-08 06:19:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507836081] [2025-03-08 06:19:27,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:27,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:19:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:19:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507836081] [2025-03-08 06:19:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507836081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:27,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:19:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725269977] [2025-03-08 06:19:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:19:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:27,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:19:27,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:27,235 INFO L87 Difference]: Start difference. First operand 1321 states and 2025 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-08 06:19:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:27,414 INFO L93 Difference]: Finished difference Result 3648 states and 5640 transitions. [2025-03-08 06:19:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:19:27,415 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-08 06:19:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:27,421 INFO L225 Difference]: With dead ends: 3648 [2025-03-08 06:19:27,422 INFO L226 Difference]: Without dead ends: 2401 [2025-03-08 06:19:27,423 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-08 06:19:27,424 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 956 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:27,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 248 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-03-08 06:19:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2399. [2025-03-08 06:19:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.536697247706422) internal successors, (3685), 2398 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3685 transitions. [2025-03-08 06:19:27,475 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3685 transitions. Word has length 67 [2025-03-08 06:19:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3685 transitions. [2025-03-08 06:19:27,476 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-08 06:19:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3685 transitions. [2025-03-08 06:19:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:19:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:27,477 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-08 06:19:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:19:27,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash 400489446, now seen corresponding path program 1 times [2025-03-08 06:19:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-08 06:19:27,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:27,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:19:27,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:19:27,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:27,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:27,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-08 06:19:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450757382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:19:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330854681] [2025-03-08 06:19:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:27,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:19:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:27,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:19:27,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:27,590 INFO L87 Difference]: Start difference. First operand 2399 states and 3685 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-08 06:19:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:27,796 INFO L93 Difference]: Finished difference Result 6925 states and 10693 transitions. [2025-03-08 06:19:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:19:27,797 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-08 06:19:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:27,810 INFO L225 Difference]: With dead ends: 6925 [2025-03-08 06:19:27,811 INFO L226 Difference]: Without dead ends: 4577 [2025-03-08 06:19:27,817 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-08 06:19:27,819 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 982 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:27,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 246 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2025-03-08 06:19:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4575. [2025-03-08 06:19:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 7018 transitions. [2025-03-08 06:19:27,908 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 7018 transitions. Word has length 67 [2025-03-08 06:19:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 4575 states and 7018 transitions. [2025-03-08 06:19:27,909 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-08 06:19:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 7018 transitions. [2025-03-08 06:19:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:19:27,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:27,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:19:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:19:27,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1276308846, now seen corresponding path program 1 times [2025-03-08 06:19:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530574481] [2025-03-08 06:19:27,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:27,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:19:27,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:19:27,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:27,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530574481] [2025-03-08 06:19:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530574481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:19:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372256974] [2025-03-08 06:19:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:19:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:28,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:19:28,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:28,027 INFO L87 Difference]: Start difference. First operand 4575 states and 7018 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-08 06:19:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:28,241 INFO L93 Difference]: Finished difference Result 12541 states and 19291 transitions. [2025-03-08 06:19:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:19:28,242 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-08 06:19:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:28,267 INFO L225 Difference]: With dead ends: 12541 [2025-03-08 06:19:28,267 INFO L226 Difference]: Without dead ends: 8001 [2025-03-08 06:19:28,276 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-08 06:19:28,277 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1012 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:28,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 242 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2025-03-08 06:19:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 7999. [2025-03-08 06:19:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7999 states, 7998 states have (on average 1.5250062515628908) internal successors, (12197), 7998 states have internal predecessors, (12197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 12197 transitions. [2025-03-08 06:19:28,433 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 12197 transitions. Word has length 67 [2025-03-08 06:19:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 7999 states and 12197 transitions. [2025-03-08 06:19:28,433 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-08 06:19:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 12197 transitions. [2025-03-08 06:19:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:19:28,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:28,438 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-08 06:19:28,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:19:28,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:28,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1882816673, now seen corresponding path program 1 times [2025-03-08 06:19:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913172556] [2025-03-08 06:19:28,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:19:28,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:19:28,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:28,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913172556] [2025-03-08 06:19:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913172556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:19:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060324069] [2025-03-08 06:19:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:19:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:28,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:19:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:28,690 INFO L87 Difference]: Start difference. First operand 7999 states and 12197 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-08 06:19:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:28,724 INFO L93 Difference]: Finished difference Result 8225 states and 12534 transitions. [2025-03-08 06:19:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:19:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-08 06:19:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:28,745 INFO L225 Difference]: With dead ends: 8225 [2025-03-08 06:19:28,746 INFO L226 Difference]: Without dead ends: 8223 [2025-03-08 06:19:28,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:19:28,749 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:28,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 966 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2025-03-08 06:19:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2025-03-08 06:19:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 1.510702991972756) internal successors, (12421), 8222 states have internal predecessors, (12421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 12421 transitions. [2025-03-08 06:19:28,865 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 12421 transitions. Word has length 68 [2025-03-08 06:19:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:28,866 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 12421 transitions. [2025-03-08 06:19:28,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-08 06:19:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 12421 transitions. [2025-03-08 06:19:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:19:28,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:28,869 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-08 06:19:28,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:19:28,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1766999374, now seen corresponding path program 1 times [2025-03-08 06:19:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-08 06:19:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:28,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:19:28,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:19:28,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:28,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:29,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-08 06:19:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-08 06:19:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:19:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114208218] [2025-03-08 06:19:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:29,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:19:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:29,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:19:29,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:19:29,019 INFO L87 Difference]: Start difference. First operand 8223 states and 12421 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:19:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:29,087 INFO L93 Difference]: Finished difference Result 22283 states and 33599 transitions. [2025-03-08 06:19:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:19:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:19:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:29,111 INFO L225 Difference]: With dead ends: 22283 [2025-03-08 06:19:29,112 INFO L226 Difference]: Without dead ends: 14633 [2025-03-08 06:19:29,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:19:29,120 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 201 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 610 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-08 06:19:29,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 610 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14633 states. [2025-03-08 06:19:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14633 to 14631. [2025-03-08 06:19:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14631 states, 14630 states have (on average 1.4958988380041012) internal successors, (21885), 14630 states have internal predecessors, (21885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14631 states to 14631 states and 21885 transitions. [2025-03-08 06:19:29,286 INFO L78 Accepts]: Start accepts. Automaton has 14631 states and 21885 transitions. Word has length 69 [2025-03-08 06:19:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:29,286 INFO L471 AbstractCegarLoop]: Abstraction has 14631 states and 21885 transitions. [2025-03-08 06:19:29,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 06:19:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14631 states and 21885 transitions. [2025-03-08 06:19:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:29,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:29,288 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-08 06:19:29,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:19:29,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:29,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1733795456, now seen corresponding path program 1 times [2025-03-08 06:19:29,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:29,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341053524] [2025-03-08 06:19:29,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:29,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:29,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:29,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:29,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-08 06:19:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341053524] [2025-03-08 06:19:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341053524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286734475] [2025-03-08 06:19:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:29,335 INFO L87 Difference]: Start difference. First operand 14631 states and 21885 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:29,402 INFO L93 Difference]: Finished difference Result 32044 states and 47901 transitions. [2025-03-08 06:19:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 06:19:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:29,506 INFO L225 Difference]: With dead ends: 32044 [2025-03-08 06:19:29,507 INFO L226 Difference]: Without dead ends: 19520 [2025-03-08 06:19:29,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:29,518 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:29,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 467 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19520 states. [2025-03-08 06:19:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19520 to 19333. [2025-03-08 06:19:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19333 states, 19332 states have (on average 1.473463687150838) internal successors, (28485), 19332 states have internal predecessors, (28485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19333 states to 19333 states and 28485 transitions. [2025-03-08 06:19:29,739 INFO L78 Accepts]: Start accepts. Automaton has 19333 states and 28485 transitions. Word has length 70 [2025-03-08 06:19:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:29,739 INFO L471 AbstractCegarLoop]: Abstraction has 19333 states and 28485 transitions. [2025-03-08 06:19:29,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 19333 states and 28485 transitions. [2025-03-08 06:19:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:29,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:29,742 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-08 06:19:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:19:29,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:29,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 903569409, now seen corresponding path program 1 times [2025-03-08 06:19:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887326128] [2025-03-08 06:19:29,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:29,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887326128] [2025-03-08 06:19:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887326128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790371535] [2025-03-08 06:19:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:29,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:29,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:29,785 INFO L87 Difference]: Start difference. First operand 19333 states and 28485 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:29,922 INFO L93 Difference]: Finished difference Result 34788 states and 51067 transitions. [2025-03-08 06:19:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 06:19:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:29,959 INFO L225 Difference]: With dead ends: 34788 [2025-03-08 06:19:29,960 INFO L226 Difference]: Without dead ends: 22398 [2025-03-08 06:19:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:29,977 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 152 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:29,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 484 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2025-03-08 06:19:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 22159. [2025-03-08 06:19:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22159 states, 22158 states have (on average 1.443722357613503) internal successors, (31990), 22158 states have internal predecessors, (31990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22159 states to 22159 states and 31990 transitions. [2025-03-08 06:19:30,286 INFO L78 Accepts]: Start accepts. Automaton has 22159 states and 31990 transitions. Word has length 70 [2025-03-08 06:19:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:30,286 INFO L471 AbstractCegarLoop]: Abstraction has 22159 states and 31990 transitions. [2025-03-08 06:19:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22159 states and 31990 transitions. [2025-03-08 06:19:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:30,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:30,290 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-08 06:19:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:19:30,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:30,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 574085408, now seen corresponding path program 1 times [2025-03-08 06:19:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581840618] [2025-03-08 06:19:30,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:30,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:30,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:30,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:30,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:30,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:30,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581840618] [2025-03-08 06:19:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581840618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:30,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028823809] [2025-03-08 06:19:30,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:30,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:30,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:30,403 INFO L87 Difference]: Start difference. First operand 22159 states and 31990 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:30,543 INFO L93 Difference]: Finished difference Result 43324 states and 62743 transitions. [2025-03-08 06:19:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:30,603 INFO L225 Difference]: With dead ends: 43324 [2025-03-08 06:19:30,604 INFO L226 Difference]: Without dead ends: 38930 [2025-03-08 06:19:30,619 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-08 06:19:30,620 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1146 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:30,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1290 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38930 states. [2025-03-08 06:19:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38930 to 26493. [2025-03-08 06:19:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26493 states, 26492 states have (on average 1.4408878151894913) internal successors, (38172), 26492 states have internal predecessors, (38172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 38172 transitions. [2025-03-08 06:19:31,069 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 38172 transitions. Word has length 70 [2025-03-08 06:19:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:31,069 INFO L471 AbstractCegarLoop]: Abstraction has 26493 states and 38172 transitions. [2025-03-08 06:19:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 38172 transitions. [2025-03-08 06:19:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:31,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:31,072 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-08 06:19:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:19:31,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 661224353, now seen corresponding path program 1 times [2025-03-08 06:19:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-03-08 06:19:31,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:31,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:31,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-03-08 06:19:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267637413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295462480] [2025-03-08 06:19:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:31,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:31,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:31,122 INFO L87 Difference]: Start difference. First operand 26493 states and 38172 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:31,229 INFO L93 Difference]: Finished difference Result 58687 states and 84388 transitions. [2025-03-08 06:19:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 06:19:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:31,287 INFO L225 Difference]: With dead ends: 58687 [2025-03-08 06:19:31,287 INFO L226 Difference]: Without dead ends: 34472 [2025-03-08 06:19:31,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:31,315 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 173 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:31,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 463 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34472 states. [2025-03-08 06:19:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34472 to 34364. [2025-03-08 06:19:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34364 states, 34363 states have (on average 1.4161743735995111) internal successors, (48664), 34363 states have internal predecessors, (48664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 48664 transitions. [2025-03-08 06:19:31,828 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 48664 transitions. Word has length 70 [2025-03-08 06:19:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:31,828 INFO L471 AbstractCegarLoop]: Abstraction has 34364 states and 48664 transitions. [2025-03-08 06:19:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 48664 transitions. [2025-03-08 06:19:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:31,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:31,833 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-08 06:19:31,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:19:31,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1568873343, now seen corresponding path program 1 times [2025-03-08 06:19:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369290424] [2025-03-08 06:19:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:31,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:31,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369290424] [2025-03-08 06:19:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369290424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924986374] [2025-03-08 06:19:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:31,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:31,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:31,939 INFO L87 Difference]: Start difference. First operand 34364 states and 48664 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:32,178 INFO L93 Difference]: Finished difference Result 66199 states and 94238 transitions. [2025-03-08 06:19:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:32,258 INFO L225 Difference]: With dead ends: 66199 [2025-03-08 06:19:32,259 INFO L226 Difference]: Without dead ends: 58157 [2025-03-08 06:19:32,281 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-08 06:19:32,282 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1037 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:32,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58157 states. [2025-03-08 06:19:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58157 to 42329. [2025-03-08 06:19:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42329 states, 42328 states have (on average 1.4155641655641655) internal successors, (59918), 42328 states have internal predecessors, (59918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42329 states to 42329 states and 59918 transitions. [2025-03-08 06:19:33,002 INFO L78 Accepts]: Start accepts. Automaton has 42329 states and 59918 transitions. Word has length 70 [2025-03-08 06:19:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:33,002 INFO L471 AbstractCegarLoop]: Abstraction has 42329 states and 59918 transitions. [2025-03-08 06:19:33,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42329 states and 59918 transitions. [2025-03-08 06:19:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:33,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:33,006 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-08 06:19:33,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:19:33,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2070599040, now seen corresponding path program 1 times [2025-03-08 06:19:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956946438] [2025-03-08 06:19:33,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:33,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:33,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:33,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:33,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956946438] [2025-03-08 06:19:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956946438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:33,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583428165] [2025-03-08 06:19:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:33,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:33,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:33,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:33,119 INFO L87 Difference]: Start difference. First operand 42329 states and 59918 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:33,377 INFO L93 Difference]: Finished difference Result 77620 states and 110486 transitions. [2025-03-08 06:19:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:33,468 INFO L225 Difference]: With dead ends: 77620 [2025-03-08 06:19:33,468 INFO L226 Difference]: Without dead ends: 66026 [2025-03-08 06:19:33,496 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-08 06:19:33,497 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1103 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:33,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1309 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:19:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66026 states. [2025-03-08 06:19:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66026 to 50640. [2025-03-08 06:19:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50640 states, 50639 states have (on average 1.4174845474831652) internal successors, (71780), 50639 states have internal predecessors, (71780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50640 states to 50640 states and 71780 transitions. [2025-03-08 06:19:34,395 INFO L78 Accepts]: Start accepts. Automaton has 50640 states and 71780 transitions. Word has length 70 [2025-03-08 06:19:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 50640 states and 71780 transitions. [2025-03-08 06:19:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 50640 states and 71780 transitions. [2025-03-08 06:19:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:19:34,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:34,398 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-08 06:19:34,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:19:34,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:34,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1167374047, now seen corresponding path program 1 times [2025-03-08 06:19:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794325889] [2025-03-08 06:19:34,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:34,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:19:34,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:19:34,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:34,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794325889] [2025-03-08 06:19:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794325889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436094357] [2025-03-08 06:19:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:34,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:19:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:34,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:19:34,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:19:34,477 INFO L87 Difference]: Start difference. First operand 50640 states and 71780 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:34,691 INFO L93 Difference]: Finished difference Result 87381 states and 124314 transitions. [2025-03-08 06:19:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:19:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:34,778 INFO L225 Difference]: With dead ends: 87381 [2025-03-08 06:19:34,778 INFO L226 Difference]: Without dead ends: 75665 [2025-03-08 06:19:34,808 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-08 06:19:34,808 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1114 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:34,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1092 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75665 states. [2025-03-08 06:19:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75665 to 55849. [2025-03-08 06:19:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55849 states, 55848 states have (on average 1.4180633147113595) internal successors, (79196), 55848 states have internal predecessors, (79196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55849 states to 55849 states and 79196 transitions. [2025-03-08 06:19:35,783 INFO L78 Accepts]: Start accepts. Automaton has 55849 states and 79196 transitions. Word has length 70 [2025-03-08 06:19:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 55849 states and 79196 transitions. [2025-03-08 06:19:35,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) 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-08 06:19:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 55849 states and 79196 transitions. [2025-03-08 06:19:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:19:35,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:35,789 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-08 06:19:35,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:19:35,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2063564947, now seen corresponding path program 1 times [2025-03-08 06:19:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683890982] [2025-03-08 06:19:35,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:35,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:19:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:19:35,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:35,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:35,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-08 06:19:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683890982] [2025-03-08 06:19:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683890982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451733478] [2025-03-08 06:19:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:35,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:35,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:35,840 INFO L87 Difference]: Start difference. First operand 55849 states and 79196 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-08 06:19:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:36,029 INFO L93 Difference]: Finished difference Result 83481 states and 117611 transitions. [2025-03-08 06:19:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:36,029 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-08 06:19:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:36,098 INFO L225 Difference]: With dead ends: 83481 [2025-03-08 06:19:36,098 INFO L226 Difference]: Without dead ends: 53257 [2025-03-08 06:19:36,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:36,131 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 138 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:36,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 554 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2025-03-08 06:19:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 46978. [2025-03-08 06:19:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46978 states, 46977 states have (on average 1.39008450944079) internal successors, (65302), 46977 states have internal predecessors, (65302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46978 states to 46978 states and 65302 transitions. [2025-03-08 06:19:36,751 INFO L78 Accepts]: Start accepts. Automaton has 46978 states and 65302 transitions. Word has length 73 [2025-03-08 06:19:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 46978 states and 65302 transitions. [2025-03-08 06:19:36,752 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-08 06:19:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46978 states and 65302 transitions. [2025-03-08 06:19:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:19:36,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:36,757 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-08 06:19:36,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:19:36,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:36,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 993648459, now seen corresponding path program 1 times [2025-03-08 06:19:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399198082] [2025-03-08 06:19:36,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:36,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:19:36,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:19:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399198082] [2025-03-08 06:19:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399198082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:36,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502591057] [2025-03-08 06:19:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:36,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:19:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:36,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:19:36,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:19:36,858 INFO L87 Difference]: Start difference. First operand 46978 states and 65302 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:37,466 INFO L93 Difference]: Finished difference Result 139106 states and 191603 transitions. [2025-03-08 06:19:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:19:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:37,627 INFO L225 Difference]: With dead ends: 139106 [2025-03-08 06:19:37,628 INFO L226 Difference]: Without dead ends: 121823 [2025-03-08 06:19:37,676 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-08 06:19:37,677 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1614 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:37,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 454 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121823 states. [2025-03-08 06:19:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121823 to 47174. [2025-03-08 06:19:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47174 states, 47173 states have (on average 1.3896508596018908) internal successors, (65554), 47173 states have internal predecessors, (65554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47174 states to 47174 states and 65554 transitions. [2025-03-08 06:19:38,972 INFO L78 Accepts]: Start accepts. Automaton has 47174 states and 65554 transitions. Word has length 75 [2025-03-08 06:19:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:38,972 INFO L471 AbstractCegarLoop]: Abstraction has 47174 states and 65554 transitions. [2025-03-08 06:19:38,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 47174 states and 65554 transitions. [2025-03-08 06:19:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:19:38,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:38,979 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-08 06:19:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:19:38,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 92701932, now seen corresponding path program 1 times [2025-03-08 06:19:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852024616] [2025-03-08 06:19:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:38,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:19:39,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:19:39,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:39,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852024616] [2025-03-08 06:19:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852024616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352336503] [2025-03-08 06:19:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:39,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:19:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:19:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:19:39,199 INFO L87 Difference]: Start difference. First operand 47174 states and 65554 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:39,773 INFO L93 Difference]: Finished difference Result 148799 states and 205992 transitions. [2025-03-08 06:19:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:19:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:39,935 INFO L225 Difference]: With dead ends: 148799 [2025-03-08 06:19:39,935 INFO L226 Difference]: Without dead ends: 125984 [2025-03-08 06:19:39,985 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-08 06:19:39,985 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1767 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:39,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 468 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125984 states. [2025-03-08 06:19:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125984 to 47290. [2025-03-08 06:19:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47290 states, 47289 states have (on average 1.3892660026644674) internal successors, (65697), 47289 states have internal predecessors, (65697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47290 states to 47290 states and 65697 transitions. [2025-03-08 06:19:41,043 INFO L78 Accepts]: Start accepts. Automaton has 47290 states and 65697 transitions. Word has length 75 [2025-03-08 06:19:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:41,043 INFO L471 AbstractCegarLoop]: Abstraction has 47290 states and 65697 transitions. [2025-03-08 06:19:41,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 47290 states and 65697 transitions. [2025-03-08 06:19:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:19:41,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:41,048 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-08 06:19:41,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:19:41,048 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1428162901, now seen corresponding path program 1 times [2025-03-08 06:19:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070395842] [2025-03-08 06:19:41,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:19:41,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:19:41,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070395842] [2025-03-08 06:19:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070395842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196521963] [2025-03-08 06:19:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:19:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:41,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:19:41,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:19:41,126 INFO L87 Difference]: Start difference. First operand 47290 states and 65697 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:41,601 INFO L93 Difference]: Finished difference Result 112040 states and 153709 transitions. [2025-03-08 06:19:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:19:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:41,737 INFO L225 Difference]: With dead ends: 112040 [2025-03-08 06:19:41,738 INFO L226 Difference]: Without dead ends: 103129 [2025-03-08 06:19:41,778 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-08 06:19:41,779 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1436 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:41,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 445 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103129 states. [2025-03-08 06:19:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103129 to 47672. [2025-03-08 06:19:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47672 states, 47671 states have (on average 1.3879717228503703) internal successors, (66166), 47671 states have internal predecessors, (66166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 66166 transitions. [2025-03-08 06:19:42,780 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 66166 transitions. Word has length 75 [2025-03-08 06:19:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 47672 states and 66166 transitions. [2025-03-08 06:19:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 66166 transitions. [2025-03-08 06:19:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:19:42,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:42,788 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-08 06:19:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:19:42,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -113043957, now seen corresponding path program 1 times [2025-03-08 06:19:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904369900] [2025-03-08 06:19:42,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:19:42,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:19:42,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:42,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:42,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904369900] [2025-03-08 06:19:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904369900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:19:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901986503] [2025-03-08 06:19:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:42,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:19:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:42,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:19:42,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:19:42,895 INFO L87 Difference]: Start difference. First operand 47672 states and 66166 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:43,492 INFO L93 Difference]: Finished difference Result 118388 states and 162730 transitions. [2025-03-08 06:19:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:19:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:43,589 INFO L225 Difference]: With dead ends: 118388 [2025-03-08 06:19:43,590 INFO L226 Difference]: Without dead ends: 90795 [2025-03-08 06:19:43,621 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-08 06:19:43,621 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1226 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:43,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 401 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90795 states. [2025-03-08 06:19:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90795 to 47722. [2025-03-08 06:19:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47722 states, 47721 states have (on average 1.3877747742084199) internal successors, (66226), 47721 states have internal predecessors, (66226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47722 states to 47722 states and 66226 transitions. [2025-03-08 06:19:44,332 INFO L78 Accepts]: Start accepts. Automaton has 47722 states and 66226 transitions. Word has length 75 [2025-03-08 06:19:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:44,332 INFO L471 AbstractCegarLoop]: Abstraction has 47722 states and 66226 transitions. [2025-03-08 06:19:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-08 06:19:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47722 states and 66226 transitions. [2025-03-08 06:19:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:19:44,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:44,339 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-08 06:19:44,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:19:44,339 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 965654185, now seen corresponding path program 1 times [2025-03-08 06:19:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786608237] [2025-03-08 06:19:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:19:44,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:19:44,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:44,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:44,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786608237] [2025-03-08 06:19:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786608237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:44,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:19:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415350090] [2025-03-08 06:19:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:19:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:44,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:19:44,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:19:44,578 INFO L87 Difference]: Start difference. First operand 47722 states and 66226 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:45,129 INFO L93 Difference]: Finished difference Result 82379 states and 113806 transitions. [2025-03-08 06:19:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:19:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:45,210 INFO L225 Difference]: With dead ends: 82379 [2025-03-08 06:19:45,210 INFO L226 Difference]: Without dead ends: 69746 [2025-03-08 06:19:45,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:19:45,241 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1343 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:45,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 744 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69746 states. [2025-03-08 06:19:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69746 to 47429. [2025-03-08 06:19:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47429 states, 47428 states have (on average 1.3875769587585394) internal successors, (65810), 47428 states have internal predecessors, (65810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47429 states to 47429 states and 65810 transitions. [2025-03-08 06:19:45,942 INFO L78 Accepts]: Start accepts. Automaton has 47429 states and 65810 transitions. Word has length 77 [2025-03-08 06:19:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:45,943 INFO L471 AbstractCegarLoop]: Abstraction has 47429 states and 65810 transitions. [2025-03-08 06:19:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 47429 states and 65810 transitions. [2025-03-08 06:19:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:19:45,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:45,949 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-08 06:19:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:19:45,950 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -563846519, now seen corresponding path program 1 times [2025-03-08 06:19:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:45,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-03-08 06:19:45,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:45,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:19:45,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:19:45,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-03-08 06:19:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711085038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:46,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:19:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378626861] [2025-03-08 06:19:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:19:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:46,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:19:46,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:19:46,326 INFO L87 Difference]: Start difference. First operand 47429 states and 65810 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:47,053 INFO L93 Difference]: Finished difference Result 123473 states and 170987 transitions. [2025-03-08 06:19:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:19:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:47,159 INFO L225 Difference]: With dead ends: 123473 [2025-03-08 06:19:47,160 INFO L226 Difference]: Without dead ends: 77562 [2025-03-08 06:19:47,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:19:47,211 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 665 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:47,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 897 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77562 states. [2025-03-08 06:19:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77562 to 47065. [2025-03-08 06:19:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47065 states, 47064 states have (on average 1.387302396736359) internal successors, (65292), 47064 states have internal predecessors, (65292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47065 states to 47065 states and 65292 transitions. [2025-03-08 06:19:48,122 INFO L78 Accepts]: Start accepts. Automaton has 47065 states and 65292 transitions. Word has length 77 [2025-03-08 06:19:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:48,122 INFO L471 AbstractCegarLoop]: Abstraction has 47065 states and 65292 transitions. [2025-03-08 06:19:48,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47065 states and 65292 transitions. [2025-03-08 06:19:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:19:48,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:48,128 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-08 06:19:48,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:19:48,128 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1872726423, now seen corresponding path program 1 times [2025-03-08 06:19:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829917585] [2025-03-08 06:19:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:48,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:19:48,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:19:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:48,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829917585] [2025-03-08 06:19:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829917585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:19:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352736490] [2025-03-08 06:19:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:48,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:19:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:48,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:19:48,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:19:48,346 INFO L87 Difference]: Start difference. First operand 47065 states and 65292 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:48,993 INFO L93 Difference]: Finished difference Result 119232 states and 165211 transitions. [2025-03-08 06:19:48,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:19:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:49,088 INFO L225 Difference]: With dead ends: 119232 [2025-03-08 06:19:49,088 INFO L226 Difference]: Without dead ends: 77631 [2025-03-08 06:19:49,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:19:49,308 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1391 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:49,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 870 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77631 states. [2025-03-08 06:19:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77631 to 46960. [2025-03-08 06:19:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46960 states, 46959 states have (on average 1.3866351498115377) internal successors, (65115), 46959 states have internal predecessors, (65115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46960 states to 46960 states and 65115 transitions. [2025-03-08 06:19:49,792 INFO L78 Accepts]: Start accepts. Automaton has 46960 states and 65115 transitions. Word has length 77 [2025-03-08 06:19:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:49,792 INFO L471 AbstractCegarLoop]: Abstraction has 46960 states and 65115 transitions. [2025-03-08 06:19:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46960 states and 65115 transitions. [2025-03-08 06:19:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:19:49,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:49,796 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-08 06:19:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:19:49,796 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 873331243, now seen corresponding path program 1 times [2025-03-08 06:19:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412638639] [2025-03-08 06:19:49,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:49,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:19:49,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:19:49,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412638639] [2025-03-08 06:19:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412638639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:19:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310511623] [2025-03-08 06:19:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:50,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:19:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:19:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:19:50,159 INFO L87 Difference]: Start difference. First operand 46960 states and 65115 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:50,785 INFO L93 Difference]: Finished difference Result 100341 states and 139071 transitions. [2025-03-08 06:19:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:19:50,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:50,873 INFO L225 Difference]: With dead ends: 100341 [2025-03-08 06:19:50,873 INFO L226 Difference]: Without dead ends: 70616 [2025-03-08 06:19:50,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:19:50,911 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1434 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:50,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 844 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70616 states. [2025-03-08 06:19:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70616 to 46925. [2025-03-08 06:19:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46925 states, 46924 states have (on average 1.3856022504475323) internal successors, (65018), 46924 states have internal predecessors, (65018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46925 states to 46925 states and 65018 transitions. [2025-03-08 06:19:51,666 INFO L78 Accepts]: Start accepts. Automaton has 46925 states and 65018 transitions. Word has length 77 [2025-03-08 06:19:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:51,667 INFO L471 AbstractCegarLoop]: Abstraction has 46925 states and 65018 transitions. [2025-03-08 06:19:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 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-08 06:19:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46925 states and 65018 transitions. [2025-03-08 06:19:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:19:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:51,672 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-08 06:19:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:19:51,672 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1541639458, now seen corresponding path program 1 times [2025-03-08 06:19:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590597358] [2025-03-08 06:19:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:19:51,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:19:51,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590597358] [2025-03-08 06:19:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590597358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:19:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649134581] [2025-03-08 06:19:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:52,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:19:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:52,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:19:52,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:19:52,215 INFO L87 Difference]: Start difference. First operand 46925 states and 65018 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-08 06:19:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:53,010 INFO L93 Difference]: Finished difference Result 101970 states and 141427 transitions. [2025-03-08 06:19:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:19:53,012 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-08 06:19:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:53,126 INFO L225 Difference]: With dead ends: 101970 [2025-03-08 06:19:53,126 INFO L226 Difference]: Without dead ends: 88644 [2025-03-08 06:19:53,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:19:53,163 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1742 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:53,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1828 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:19:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88644 states. [2025-03-08 06:19:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88644 to 46894. [2025-03-08 06:19:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46894 states, 46893 states have (on average 1.3856439127375089) internal successors, (64977), 46893 states have internal predecessors, (64977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46894 states to 46894 states and 64977 transitions. [2025-03-08 06:19:53,907 INFO L78 Accepts]: Start accepts. Automaton has 46894 states and 64977 transitions. Word has length 78 [2025-03-08 06:19:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:53,907 INFO L471 AbstractCegarLoop]: Abstraction has 46894 states and 64977 transitions. [2025-03-08 06:19:53,907 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-08 06:19:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 46894 states and 64977 transitions. [2025-03-08 06:19:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:19:53,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:53,910 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-08 06:19:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:19:53,911 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -408550813, now seen corresponding path program 1 times [2025-03-08 06:19:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810594619] [2025-03-08 06:19:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:53,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:19:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:19:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810594619] [2025-03-08 06:19:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810594619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:54,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:54,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:19:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934616204] [2025-03-08 06:19:54,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:54,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:19:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:54,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:19:54,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:19:54,427 INFO L87 Difference]: Start difference. First operand 46894 states and 64977 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-08 06:19:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:55,303 INFO L93 Difference]: Finished difference Result 132361 states and 183033 transitions. [2025-03-08 06:19:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:19:55,304 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-08 06:19:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:55,474 INFO L225 Difference]: With dead ends: 132361 [2025-03-08 06:19:55,474 INFO L226 Difference]: Without dead ends: 127153 [2025-03-08 06:19:55,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:19:55,524 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1761 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:55,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2233 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127153 states. [2025-03-08 06:19:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127153 to 46200. [2025-03-08 06:19:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46200 states, 46199 states have (on average 1.386155544492305) internal successors, (64039), 46199 states have internal predecessors, (64039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46200 states to 46200 states and 64039 transitions. [2025-03-08 06:19:56,520 INFO L78 Accepts]: Start accepts. Automaton has 46200 states and 64039 transitions. Word has length 78 [2025-03-08 06:19:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 46200 states and 64039 transitions. [2025-03-08 06:19:56,520 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-08 06:19:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46200 states and 64039 transitions. [2025-03-08 06:19:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:19:56,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:56,523 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] [2025-03-08 06:19:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:19:56,524 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -248041127, now seen corresponding path program 1 times [2025-03-08 06:19:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355585004] [2025-03-08 06:19:56,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:56,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:19:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:19:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355585004] [2025-03-08 06:19:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355585004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:56,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498752501] [2025-03-08 06:19:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:56,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:56,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:56,559 INFO L87 Difference]: Start difference. First operand 46200 states and 64039 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:57,040 INFO L93 Difference]: Finished difference Result 102903 states and 142742 transitions. [2025-03-08 06:19:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 06:19:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:57,132 INFO L225 Difference]: With dead ends: 102903 [2025-03-08 06:19:57,132 INFO L226 Difference]: Without dead ends: 73481 [2025-03-08 06:19:57,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:57,148 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 194 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:57,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 372 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73481 states. [2025-03-08 06:19:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73481 to 73214. [2025-03-08 06:19:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73214 states, 73213 states have (on average 1.3888243891112235) internal successors, (101680), 73213 states have internal predecessors, (101680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73214 states to 73214 states and 101680 transitions. [2025-03-08 06:19:58,267 INFO L78 Accepts]: Start accepts. Automaton has 73214 states and 101680 transitions. Word has length 79 [2025-03-08 06:19:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:58,267 INFO L471 AbstractCegarLoop]: Abstraction has 73214 states and 101680 transitions. [2025-03-08 06:19:58,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 73214 states and 101680 transitions. [2025-03-08 06:19:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:19:58,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:58,271 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] [2025-03-08 06:19:58,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:19:58,271 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:58,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1173505979, now seen corresponding path program 1 times [2025-03-08 06:19:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773136401] [2025-03-08 06:19:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:58,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:19:58,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:19:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773136401] [2025-03-08 06:19:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773136401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:58,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466281698] [2025-03-08 06:19:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:58,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:58,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:58,304 INFO L87 Difference]: Start difference. First operand 73214 states and 101680 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:58,624 INFO L93 Difference]: Finished difference Result 149108 states and 207123 transitions. [2025-03-08 06:19:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:19:58,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 06:19:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:58,756 INFO L225 Difference]: With dead ends: 149108 [2025-03-08 06:19:58,756 INFO L226 Difference]: Without dead ends: 100415 [2025-03-08 06:19:58,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:58,815 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 176 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:58,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 359 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:19:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100415 states. [2025-03-08 06:19:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100415 to 66756. [2025-03-08 06:19:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66756 states, 66755 states have (on average 1.3889296681896488) internal successors, (92718), 66755 states have internal predecessors, (92718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66756 states to 66756 states and 92718 transitions. [2025-03-08 06:19:59,780 INFO L78 Accepts]: Start accepts. Automaton has 66756 states and 92718 transitions. Word has length 79 [2025-03-08 06:19:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 66756 states and 92718 transitions. [2025-03-08 06:19:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66756 states and 92718 transitions. [2025-03-08 06:19:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:19:59,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:59,784 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] [2025-03-08 06:19:59,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:19:59,785 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:19:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2059735434, now seen corresponding path program 1 times [2025-03-08 06:19:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:59,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522027049] [2025-03-08 06:19:59,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:19:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:19:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522027049] [2025-03-08 06:19:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522027049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:59,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:59,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:19:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684869299] [2025-03-08 06:19:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:59,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:19:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:19:59,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:19:59,823 INFO L87 Difference]: Start difference. First operand 66756 states and 92718 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:00,017 INFO L93 Difference]: Finished difference Result 103696 states and 143773 transitions. [2025-03-08 06:20:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 06:20:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:00,086 INFO L225 Difference]: With dead ends: 103696 [2025-03-08 06:20:00,086 INFO L226 Difference]: Without dead ends: 61456 [2025-03-08 06:20:00,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:00,122 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 158 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 598 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-08 06:20:00,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 598 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61456 states. [2025-03-08 06:20:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61456 to 61454. [2025-03-08 06:20:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61454 states, 61453 states have (on average 1.3758644817990986) internal successors, (84551), 61453 states have internal predecessors, (84551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61454 states to 61454 states and 84551 transitions. [2025-03-08 06:20:00,864 INFO L78 Accepts]: Start accepts. Automaton has 61454 states and 84551 transitions. Word has length 81 [2025-03-08 06:20:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:00,864 INFO L471 AbstractCegarLoop]: Abstraction has 61454 states and 84551 transitions. [2025-03-08 06:20:00,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 61454 states and 84551 transitions. [2025-03-08 06:20:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:20:00,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:00,868 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-08 06:20:00,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:20:00,869 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:20:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1743003449, now seen corresponding path program 1 times [2025-03-08 06:20:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180045133] [2025-03-08 06:20:00,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:00,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:20:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:20:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180045133] [2025-03-08 06:20:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180045133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640861999] [2025-03-08 06:20:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:00,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:00,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:00,899 INFO L87 Difference]: Start difference. First operand 61454 states and 84551 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:01,121 INFO L93 Difference]: Finished difference Result 115541 states and 159459 transitions. [2025-03-08 06:20:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:01,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:01,203 INFO L225 Difference]: With dead ends: 115541 [2025-03-08 06:20:01,203 INFO L226 Difference]: Without dead ends: 78257 [2025-03-08 06:20:01,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:01,242 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 188 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:01,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 429 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78257 states. [2025-03-08 06:20:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78257 to 59707. [2025-03-08 06:20:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59707 states, 59706 states have (on average 1.3735805446688776) internal successors, (82011), 59706 states have internal predecessors, (82011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59707 states to 59707 states and 82011 transitions. [2025-03-08 06:20:02,310 INFO L78 Accepts]: Start accepts. Automaton has 59707 states and 82011 transitions. Word has length 82 [2025-03-08 06:20:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:02,311 INFO L471 AbstractCegarLoop]: Abstraction has 59707 states and 82011 transitions. [2025-03-08 06:20:02,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 59707 states and 82011 transitions. [2025-03-08 06:20:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:20:02,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:02,316 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-08 06:20:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:20:02,316 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:20:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -383234370, now seen corresponding path program 1 times [2025-03-08 06:20:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618342326] [2025-03-08 06:20:02,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:02,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:20:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:20:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618342326] [2025-03-08 06:20:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618342326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118317593] [2025-03-08 06:20:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:02,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:02,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:02,366 INFO L87 Difference]: Start difference. First operand 59707 states and 82011 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:02,528 INFO L93 Difference]: Finished difference Result 76505 states and 104812 transitions. [2025-03-08 06:20:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:02,588 INFO L225 Difference]: With dead ends: 76505 [2025-03-08 06:20:02,588 INFO L226 Difference]: Without dead ends: 52583 [2025-03-08 06:20:02,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:02,616 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 139 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 550 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-08 06:20:02,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 550 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52583 states. [2025-03-08 06:20:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52583 to 52581. [2025-03-08 06:20:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52581 states, 52580 states have (on average 1.3596614682388741) internal successors, (71491), 52580 states have internal predecessors, (71491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52581 states to 52581 states and 71491 transitions. [2025-03-08 06:20:03,340 INFO L78 Accepts]: Start accepts. Automaton has 52581 states and 71491 transitions. Word has length 82 [2025-03-08 06:20:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 52581 states and 71491 transitions. [2025-03-08 06:20:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-08 06:20:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52581 states and 71491 transitions. [2025-03-08 06:20:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:20:03,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:03,344 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-08 06:20:03,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:20:03,344 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:20:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash 965271617, now seen corresponding path program 1 times [2025-03-08 06:20:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577517375] [2025-03-08 06:20:03,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:03,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:20:03,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:20:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:03,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577517375] [2025-03-08 06:20:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577517375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:03,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:03,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836961749] [2025-03-08 06:20:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:03,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:03,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:03,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:03,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:03,379 INFO L87 Difference]: Start difference. First operand 52581 states and 71491 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-08 06:20:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:03,594 INFO L93 Difference]: Finished difference Result 103718 states and 141174 transitions. [2025-03-08 06:20:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-08 06:20:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:03,674 INFO L225 Difference]: With dead ends: 103718 [2025-03-08 06:20:03,674 INFO L226 Difference]: Without dead ends: 72816 [2025-03-08 06:20:03,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:03,709 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 173 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:03,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 358 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72816 states. [2025-03-08 06:20:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72816 to 51445. [2025-03-08 06:20:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51445 states, 51444 states have (on average 1.3575344063447632) internal successors, (69837), 51444 states have internal predecessors, (69837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51445 states to 51445 states and 69837 transitions. [2025-03-08 06:20:04,516 INFO L78 Accepts]: Start accepts. Automaton has 51445 states and 69837 transitions. Word has length 83 [2025-03-08 06:20:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 51445 states and 69837 transitions. [2025-03-08 06:20:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-08 06:20:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51445 states and 69837 transitions. [2025-03-08 06:20:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:20:04,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:04,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:20:04,520 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:20:04,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -764699832, now seen corresponding path program 1 times [2025-03-08 06:20:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858888043] [2025-03-08 06:20:04,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:04,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:20:04,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:20:04,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858888043] [2025-03-08 06:20:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858888043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:20:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491020520] [2025-03-08 06:20:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:04,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:20:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:04,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:20:04,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:20:04,914 INFO L87 Difference]: Start difference. First operand 51445 states and 69837 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-08 06:20:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:05,734 INFO L93 Difference]: Finished difference Result 84937 states and 115372 transitions. [2025-03-08 06:20:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-08 06:20:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:05,811 INFO L225 Difference]: With dead ends: 84937 [2025-03-08 06:20:05,812 INFO L226 Difference]: Without dead ends: 76054 [2025-03-08 06:20:05,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:20:05,838 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1093 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:05,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2624 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:20:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76054 states. [2025-03-08 06:20:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76054 to 51399. [2025-03-08 06:20:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51399 states, 51398 states have (on average 1.3576598311218335) internal successors, (69781), 51398 states have internal predecessors, (69781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51399 states to 51399 states and 69781 transitions. [2025-03-08 06:20:06,410 INFO L78 Accepts]: Start accepts. Automaton has 51399 states and 69781 transitions. Word has length 83 [2025-03-08 06:20:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 51399 states and 69781 transitions. [2025-03-08 06:20:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-08 06:20:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 51399 states and 69781 transitions. [2025-03-08 06:20:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:20:06,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:06,419 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:20:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:20:06,419 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:20:06,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1952074962, now seen corresponding path program 1 times [2025-03-08 06:20:06,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:06,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-03-08 06:20:06,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:06,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:20:06,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:20:06,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:06,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-03-08 06:20:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835578480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:06,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:06,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959164282] [2025-03-08 06:20:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:06,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:06,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:06,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:06,480 INFO L87 Difference]: Start difference. First operand 51399 states and 69781 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-08 06:20:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:06,873 INFO L93 Difference]: Finished difference Result 107833 states and 147225 transitions. [2025-03-08 06:20:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:06,873 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-08 06:20:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:06,959 INFO L225 Difference]: With dead ends: 107833 [2025-03-08 06:20:06,959 INFO L226 Difference]: Without dead ends: 78896 [2025-03-08 06:20:06,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:06,994 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:06,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 498 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:20:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78896 states. [2025-03-08 06:20:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78896 to 75544. [2025-03-08 06:20:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75544 states, 75543 states have (on average 1.3575844221172049) internal successors, (102556), 75543 states have internal predecessors, (102556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)