./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:20:38,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:20:38,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:20:38,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:20:38,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:20:38,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:20:38,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:20:38,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:20:38,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:20:38,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:20:38,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:20:38,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:20:38,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:20:38,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:20:38,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:20:38,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:38,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:20:38,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:20:38,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:20:38,412 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 -> 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac [2025-03-16 19:20:38,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:20:38,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:20:38,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:20:38,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:20:38,623 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:20:38,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:20:39,802 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00687a9/de1fafd601414491af0debd712209a5b/FLAGfecc8dc03 [2025-03-16 19:20:40,148 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:20:40,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:20:40,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00687a9/de1fafd601414491af0debd712209a5b/FLAGfecc8dc03 [2025-03-16 19:20:40,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00687a9/de1fafd601414491af0debd712209a5b [2025-03-16 19:20:40,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:20:40,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:20:40,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:40,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:20:40,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:20:40,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a982925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40, skipping insertion in model container [2025-03-16 19:20:40,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:20:40,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2025-03-16 19:20:40,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2025-03-16 19:20:40,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2025-03-16 19:20:40,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2025-03-16 19:20:40,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2025-03-16 19:20:40,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:40,577 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:20:40,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2025-03-16 19:20:40,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2025-03-16 19:20:40,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2025-03-16 19:20:40,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2025-03-16 19:20:40,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2025-03-16 19:20:40,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:40,717 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:20:40,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40 WrapperNode [2025-03-16 19:20:40,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:40,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:40,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:20:40,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:20:40,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,779 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1636 [2025-03-16 19:20:40,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:40,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:20:40,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:20:40,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:20:40,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,815 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:20:40,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:20:40,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:20:40,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:20:40,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:20:40,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (1/1) ... [2025-03-16 19:20:40,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:20:40,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:20:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:20:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:20:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:20:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:20:40,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:20:41,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:20:41,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:20:42,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:42,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L703: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#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_~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_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-16 19:20:42,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1397: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:42,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1035: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:20:42,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~8#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1796: havoc main_~check__tmp~9#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: havoc main_~check__tmp~7#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962: havoc main_~check__tmp~10#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L809: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2070: havoc main_~check__tmp~11#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L854: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:20:42,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:20:42,194 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-16 19:20:42,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:20:42,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:20:42,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:20:42,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:42 BoogieIcfgContainer [2025-03-16 19:20:42,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:20:42,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:20:42,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:20:42,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:20:42,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:20:40" (1/3) ... [2025-03-16 19:20:42,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d64c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:42, skipping insertion in model container [2025-03-16 19:20:42,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:40" (2/3) ... [2025-03-16 19:20:42,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d64c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:42, skipping insertion in model container [2025-03-16 19:20:42,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:42" (3/3) ... [2025-03-16 19:20:42,226 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:20:42,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:20:42,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 376 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-03-16 19:20:42,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:20:42,305 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;@686c3a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:20:42,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-16 19:20:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 370 states have (on average 1.8297297297297297) internal successors, (677), 375 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 19:20:42,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:42,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:42,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:42,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1443127054, now seen corresponding path program 1 times [2025-03-16 19:20:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:42,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682464299] [2025-03-16 19:20:42,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:42,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 19:20:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 19:20:42,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:42,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682464299] [2025-03-16 19:20:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682464299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101848273] [2025-03-16 19:20:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:42,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:42,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:42,950 INFO L87 Difference]: Start difference. First operand has 376 states, 370 states have (on average 1.8297297297297297) internal successors, (677), 375 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:43,093 INFO L93 Difference]: Finished difference Result 681 states and 1214 transitions. [2025-03-16 19:20:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:43,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-16 19:20:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:43,103 INFO L225 Difference]: With dead ends: 681 [2025-03-16 19:20:43,103 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 19:20:43,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:43,108 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 386 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:43,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1213 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 19:20:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2025-03-16 19:20:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 530 states have (on average 1.4792452830188678) internal successors, (784), 534 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 784 transitions. [2025-03-16 19:20:43,171 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 784 transitions. Word has length 138 [2025-03-16 19:20:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:43,171 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 784 transitions. [2025-03-16 19:20:43,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 784 transitions. [2025-03-16 19:20:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 19:20:43,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:43,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:43,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:20:43,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1432269428, now seen corresponding path program 1 times [2025-03-16 19:20:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407780579] [2025-03-16 19:20:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:43,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 19:20:43,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 19:20:43,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:43,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407780579] [2025-03-16 19:20:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407780579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575371101] [2025-03-16 19:20:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:43,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:43,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:43,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:43,450 INFO L87 Difference]: Start difference. First operand 535 states and 784 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:43,587 INFO L93 Difference]: Finished difference Result 1070 states and 1621 transitions. [2025-03-16 19:20:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-16 19:20:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:43,592 INFO L225 Difference]: With dead ends: 1070 [2025-03-16 19:20:43,592 INFO L226 Difference]: Without dead ends: 879 [2025-03-16 19:20:43,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:43,593 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 312 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:43,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 978 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-16 19:20:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2025-03-16 19:20:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 872 states have (on average 1.5) internal successors, (1308), 876 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1308 transitions. [2025-03-16 19:20:43,639 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1308 transitions. Word has length 138 [2025-03-16 19:20:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1308 transitions. [2025-03-16 19:20:43,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1308 transitions. [2025-03-16 19:20:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 19:20:43,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:43,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:20:43,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1432669620, now seen corresponding path program 1 times [2025-03-16 19:20:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745710778] [2025-03-16 19:20:43,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:43,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 19:20:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 19:20:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745710778] [2025-03-16 19:20:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745710778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118394179] [2025-03-16 19:20:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:44,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:44,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:44,155 INFO L87 Difference]: Start difference. First operand 877 states and 1308 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:44,259 INFO L93 Difference]: Finished difference Result 3379 states and 5019 transitions. [2025-03-16 19:20:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-16 19:20:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:44,268 INFO L225 Difference]: With dead ends: 3379 [2025-03-16 19:20:44,268 INFO L226 Difference]: Without dead ends: 2526 [2025-03-16 19:20:44,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:44,271 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1028 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:44,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1907 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2025-03-16 19:20:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 1667. [2025-03-16 19:20:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1662 states have (on average 1.4879663056558363) internal successors, (2473), 1666 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2473 transitions. [2025-03-16 19:20:44,334 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2473 transitions. Word has length 138 [2025-03-16 19:20:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:44,334 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2473 transitions. [2025-03-16 19:20:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2473 transitions. [2025-03-16 19:20:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:20:44,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:44,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:20:44,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:44,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 936160013, now seen corresponding path program 1 times [2025-03-16 19:20:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120180382] [2025-03-16 19:20:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:20:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:20:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:44,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120180382] [2025-03-16 19:20:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120180382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192949876] [2025-03-16 19:20:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:44,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:44,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:44,417 INFO L87 Difference]: Start difference. First operand 1667 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:44,447 INFO L93 Difference]: Finished difference Result 3309 states and 4903 transitions. [2025-03-16 19:20:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:20:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:44,453 INFO L225 Difference]: With dead ends: 3309 [2025-03-16 19:20:44,453 INFO L226 Difference]: Without dead ends: 1669 [2025-03-16 19:20:44,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:44,456 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:44,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1068 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-16 19:20:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2025-03-16 19:20:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1664 states have (on average 1.4873798076923077) internal successors, (2475), 1668 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2475 transitions. [2025-03-16 19:20:44,504 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2475 transitions. Word has length 139 [2025-03-16 19:20:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:44,505 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2475 transitions. [2025-03-16 19:20:44,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2475 transitions. [2025-03-16 19:20:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:20:44,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:44,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:20:44,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:44,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1389269228, now seen corresponding path program 1 times [2025-03-16 19:20:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921109761] [2025-03-16 19:20:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:44,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:20:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:20:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921109761] [2025-03-16 19:20:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921109761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592207214] [2025-03-16 19:20:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:44,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:44,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:44,898 INFO L87 Difference]: Start difference. First operand 1669 states and 2475 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:44,930 INFO L93 Difference]: Finished difference Result 3329 states and 4936 transitions. [2025-03-16 19:20:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-16 19:20:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:44,935 INFO L225 Difference]: With dead ends: 3329 [2025-03-16 19:20:44,936 INFO L226 Difference]: Without dead ends: 1667 [2025-03-16 19:20:44,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:44,938 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 24 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:44,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1685 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-16 19:20:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2025-03-16 19:20:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1662 states have (on average 1.48676293622142) internal successors, (2471), 1666 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2471 transitions. [2025-03-16 19:20:44,967 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2471 transitions. Word has length 140 [2025-03-16 19:20:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2471 transitions. [2025-03-16 19:20:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2471 transitions. [2025-03-16 19:20:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:20:44,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:44,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:44,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:20:44,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2045688177, now seen corresponding path program 1 times [2025-03-16 19:20:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858004547] [2025-03-16 19:20:44,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:44,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:20:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:20:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:45,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858004547] [2025-03-16 19:20:45,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858004547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:45,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540236878] [2025-03-16 19:20:45,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:45,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:45,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:45,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:45,073 INFO L87 Difference]: Start difference. First operand 1667 states and 2471 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:45,121 INFO L93 Difference]: Finished difference Result 3983 states and 5907 transitions. [2025-03-16 19:20:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:45,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-16 19:20:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:45,129 INFO L225 Difference]: With dead ends: 3983 [2025-03-16 19:20:45,129 INFO L226 Difference]: Without dead ends: 2491 [2025-03-16 19:20:45,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-16 19:20:45,131 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 464 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:45,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1413 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2025-03-16 19:20:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 2455. [2025-03-16 19:20:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 2450 states have (on average 1.4673469387755103) internal successors, (3595), 2454 states have internal predecessors, (3595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3595 transitions. [2025-03-16 19:20:45,177 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3595 transitions. Word has length 140 [2025-03-16 19:20:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 2455 states and 3595 transitions. [2025-03-16 19:20:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3595 transitions. [2025-03-16 19:20:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:20:45,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:45,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:20:45,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 525991722, now seen corresponding path program 1 times [2025-03-16 19:20:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050725156] [2025-03-16 19:20:45,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:45,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:20:45,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:20:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050725156] [2025-03-16 19:20:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050725156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:20:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367674880] [2025-03-16 19:20:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:20:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:45,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:20:45,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:45,793 INFO L87 Difference]: Start difference. First operand 2455 states and 3595 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:46,054 INFO L93 Difference]: Finished difference Result 5277 states and 7958 transitions. [2025-03-16 19:20:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 19:20:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:46,068 INFO L225 Difference]: With dead ends: 5277 [2025-03-16 19:20:46,068 INFO L226 Difference]: Without dead ends: 4291 [2025-03-16 19:20:46,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:46,072 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 2125 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:46,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 2616 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:20:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2025-03-16 19:20:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4289. [2025-03-16 19:20:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 4284 states have (on average 1.473155929038282) internal successors, (6311), 4288 states have internal predecessors, (6311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6311 transitions. [2025-03-16 19:20:46,160 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6311 transitions. Word has length 146 [2025-03-16 19:20:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6311 transitions. [2025-03-16 19:20:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6311 transitions. [2025-03-16 19:20:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:20:46,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:46,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:46,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:20:46,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:46,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2134874628, now seen corresponding path program 1 times [2025-03-16 19:20:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:46,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445606491] [2025-03-16 19:20:46,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:46,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:20:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:20:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:46,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-16 19:20:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:46,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445606491] [2025-03-16 19:20:46,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445606491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:46,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:20:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363021924] [2025-03-16 19:20:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:20:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:46,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:20:46,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:20:46,940 INFO L87 Difference]: Start difference. First operand 4289 states and 6311 transitions. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:47,851 INFO L93 Difference]: Finished difference Result 6266 states and 9238 transitions. [2025-03-16 19:20:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:20:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 19:20:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:47,869 INFO L225 Difference]: With dead ends: 6266 [2025-03-16 19:20:47,869 INFO L226 Difference]: Without dead ends: 5520 [2025-03-16 19:20:47,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:20:47,873 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 2684 mSDsluCounter, 5034 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 5690 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:47,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 5690 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:20:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2025-03-16 19:20:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 4724. [2025-03-16 19:20:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4724 states, 4719 states have (on average 1.4594193685102776) internal successors, (6887), 4723 states have internal predecessors, (6887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6887 transitions. [2025-03-16 19:20:47,979 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6887 transitions. Word has length 146 [2025-03-16 19:20:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:47,979 INFO L471 AbstractCegarLoop]: Abstraction has 4724 states and 6887 transitions. [2025-03-16 19:20:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6887 transitions. [2025-03-16 19:20:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:20:47,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:47,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:47,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:20:47,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1876709190, now seen corresponding path program 1 times [2025-03-16 19:20:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423732574] [2025-03-16 19:20:47,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:20:48,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:20:48,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423732574] [2025-03-16 19:20:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423732574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199269353] [2025-03-16 19:20:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:48,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:48,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:48,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:48,268 INFO L87 Difference]: Start difference. First operand 4724 states and 6887 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:48,373 INFO L93 Difference]: Finished difference Result 12421 states and 18041 transitions. [2025-03-16 19:20:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 19:20:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:48,394 INFO L225 Difference]: With dead ends: 12421 [2025-03-16 19:20:48,394 INFO L226 Difference]: Without dead ends: 7733 [2025-03-16 19:20:48,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:48,399 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 935 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:48,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2025-03-16 19:20:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 7703. [2025-03-16 19:20:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7703 states, 7698 states have (on average 1.4376461418550273) internal successors, (11067), 7702 states have internal predecessors, (11067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 11067 transitions. [2025-03-16 19:20:48,537 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 11067 transitions. Word has length 146 [2025-03-16 19:20:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:48,537 INFO L471 AbstractCegarLoop]: Abstraction has 7703 states and 11067 transitions. [2025-03-16 19:20:48,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 11067 transitions. [2025-03-16 19:20:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:20:48,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:48,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:48,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:20:48,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:48,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 702600483, now seen corresponding path program 1 times [2025-03-16 19:20:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129049996] [2025-03-16 19:20:48,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:48,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:20:48,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:20:48,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129049996] [2025-03-16 19:20:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129049996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:48,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187332026] [2025-03-16 19:20:48,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:48,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:48,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:48,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:48,601 INFO L87 Difference]: Start difference. First operand 7703 states and 11067 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:48,662 INFO L93 Difference]: Finished difference Result 17108 states and 24533 transitions. [2025-03-16 19:20:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:48,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-16 19:20:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:48,681 INFO L225 Difference]: With dead ends: 17108 [2025-03-16 19:20:48,682 INFO L226 Difference]: Without dead ends: 10916 [2025-03-16 19:20:48,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:48,692 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 505 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:48,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1501 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10916 states. [2025-03-16 19:20:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10916 to 7703. [2025-03-16 19:20:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7703 states, 7698 states have (on average 1.437516237983892) internal successors, (11066), 7702 states have internal predecessors, (11066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 11066 transitions. [2025-03-16 19:20:48,860 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 11066 transitions. Word has length 147 [2025-03-16 19:20:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 7703 states and 11066 transitions. [2025-03-16 19:20:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 11066 transitions. [2025-03-16 19:20:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:20:48,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:48,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:48,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:20:48,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:48,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1314673597, now seen corresponding path program 1 times [2025-03-16 19:20:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194429862] [2025-03-16 19:20:48,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:48,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:20:48,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:20:48,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:48,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:48,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:48,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194429862] [2025-03-16 19:20:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194429862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:48,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:48,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570398987] [2025-03-16 19:20:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:48,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:48,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:48,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:48,962 INFO L87 Difference]: Start difference. First operand 7703 states and 11066 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:49,082 INFO L93 Difference]: Finished difference Result 20572 states and 29448 transitions. [2025-03-16 19:20:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-16 19:20:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:49,109 INFO L225 Difference]: With dead ends: 20572 [2025-03-16 19:20:49,110 INFO L226 Difference]: Without dead ends: 13285 [2025-03-16 19:20:49,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:49,121 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 455 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:49,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1472 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2025-03-16 19:20:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 13259. [2025-03-16 19:20:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13259 states, 13254 states have (on average 1.4121020069413008) internal successors, (18716), 13258 states have internal predecessors, (18716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 18716 transitions. [2025-03-16 19:20:49,335 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 18716 transitions. Word has length 148 [2025-03-16 19:20:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:49,335 INFO L471 AbstractCegarLoop]: Abstraction has 13259 states and 18716 transitions. [2025-03-16 19:20:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 18716 transitions. [2025-03-16 19:20:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:20:49,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:49,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:20:49,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1741228095, now seen corresponding path program 1 times [2025-03-16 19:20:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315720721] [2025-03-16 19:20:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:49,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:20:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:20:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315720721] [2025-03-16 19:20:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315720721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955632258] [2025-03-16 19:20:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:49,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:49,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:49,658 INFO L87 Difference]: Start difference. First operand 13259 states and 18716 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:49,737 INFO L93 Difference]: Finished difference Result 25011 states and 35379 transitions. [2025-03-16 19:20:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-16 19:20:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:49,757 INFO L225 Difference]: With dead ends: 25011 [2025-03-16 19:20:49,757 INFO L226 Difference]: Without dead ends: 12002 [2025-03-16 19:20:49,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:49,773 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 20 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:49,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1669 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12002 states. [2025-03-16 19:20:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12002 to 12002. [2025-03-16 19:20:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12002 states, 11997 states have (on average 1.4154371926314913) internal successors, (16981), 12001 states have internal predecessors, (16981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 16981 transitions. [2025-03-16 19:20:50,024 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 16981 transitions. Word has length 148 [2025-03-16 19:20:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 12002 states and 16981 transitions. [2025-03-16 19:20:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 16981 transitions. [2025-03-16 19:20:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 19:20:50,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:50,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:50,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:20:50,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash 549713181, now seen corresponding path program 1 times [2025-03-16 19:20:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125976173] [2025-03-16 19:20:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:50,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 19:20:50,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 19:20:50,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:50,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125976173] [2025-03-16 19:20:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125976173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:20:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20817970] [2025-03-16 19:20:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:50,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:20:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:50,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:20:50,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:50,534 INFO L87 Difference]: Start difference. First operand 12002 states and 16981 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:50,879 INFO L93 Difference]: Finished difference Result 15510 states and 22640 transitions. [2025-03-16 19:20:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-16 19:20:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:50,898 INFO L225 Difference]: With dead ends: 15510 [2025-03-16 19:20:50,898 INFO L226 Difference]: Without dead ends: 10872 [2025-03-16 19:20:50,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:50,907 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 2162 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:50,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 2648 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:20:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10872 states. [2025-03-16 19:20:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10872 to 10870. [2025-03-16 19:20:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10870 states, 10865 states have (on average 1.3883110906580765) internal successors, (15084), 10869 states have internal predecessors, (15084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 15084 transitions. [2025-03-16 19:20:51,070 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 15084 transitions. Word has length 154 [2025-03-16 19:20:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:51,070 INFO L471 AbstractCegarLoop]: Abstraction has 10870 states and 15084 transitions. [2025-03-16 19:20:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 15084 transitions. [2025-03-16 19:20:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 19:20:51,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:51,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:51,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:20:51,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1016306595, now seen corresponding path program 1 times [2025-03-16 19:20:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244657216] [2025-03-16 19:20:51,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:51,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 19:20:51,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 19:20:51,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:51,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:51,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244657216] [2025-03-16 19:20:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244657216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573815282] [2025-03-16 19:20:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:51,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:51,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:51,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:51,356 INFO L87 Difference]: Start difference. First operand 10870 states and 15084 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:51,543 INFO L93 Difference]: Finished difference Result 52602 states and 72664 transitions. [2025-03-16 19:20:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:51,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-16 19:20:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:51,613 INFO L225 Difference]: With dead ends: 52602 [2025-03-16 19:20:51,614 INFO L226 Difference]: Without dead ends: 41780 [2025-03-16 19:20:51,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:51,637 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 1491 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:51,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2374 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2025-03-16 19:20:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 20894. [2025-03-16 19:20:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20894 states, 20889 states have (on average 1.367418258413519) internal successors, (28564), 20893 states have internal predecessors, (28564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20894 states to 20894 states and 28564 transitions. [2025-03-16 19:20:52,133 INFO L78 Accepts]: Start accepts. Automaton has 20894 states and 28564 transitions. Word has length 154 [2025-03-16 19:20:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 20894 states and 28564 transitions. [2025-03-16 19:20:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20894 states and 28564 transitions. [2025-03-16 19:20:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 19:20:52,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:52,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:52,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:20:52,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:52,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1360204178, now seen corresponding path program 1 times [2025-03-16 19:20:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952319489] [2025-03-16 19:20:52,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:52,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 19:20:52,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 19:20:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952319489] [2025-03-16 19:20:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952319489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:52,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046057992] [2025-03-16 19:20:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:52,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:52,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:52,233 INFO L87 Difference]: Start difference. First operand 20894 states and 28564 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:52,328 INFO L93 Difference]: Finished difference Result 41676 states and 56978 transitions. [2025-03-16 19:20:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:52,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-16 19:20:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:52,375 INFO L225 Difference]: With dead ends: 41676 [2025-03-16 19:20:52,376 INFO L226 Difference]: Without dead ends: 20902 [2025-03-16 19:20:52,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:52,407 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:52,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1060 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2025-03-16 19:20:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 20902. [2025-03-16 19:20:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20902 states, 20897 states have (on average 1.367277599655453) internal successors, (28572), 20901 states have internal predecessors, (28572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20902 states to 20902 states and 28572 transitions. [2025-03-16 19:20:52,859 INFO L78 Accepts]: Start accepts. Automaton has 20902 states and 28572 transitions. Word has length 155 [2025-03-16 19:20:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:52,859 INFO L471 AbstractCegarLoop]: Abstraction has 20902 states and 28572 transitions. [2025-03-16 19:20:52,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20902 states and 28572 transitions. [2025-03-16 19:20:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 19:20:52,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:52,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:20:52,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 541789989, now seen corresponding path program 1 times [2025-03-16 19:20:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466201143] [2025-03-16 19:20:52,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:52,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 19:20:52,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 19:20:52,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:52,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466201143] [2025-03-16 19:20:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466201143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:53,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46868516] [2025-03-16 19:20:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:53,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:53,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:53,229 INFO L87 Difference]: Start difference. First operand 20902 states and 28572 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:53,312 INFO L93 Difference]: Finished difference Result 41680 states and 56980 transitions. [2025-03-16 19:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 19:20:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:53,348 INFO L225 Difference]: With dead ends: 41680 [2025-03-16 19:20:53,349 INFO L226 Difference]: Without dead ends: 20902 [2025-03-16 19:20:53,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:53,374 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 10 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1637 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2025-03-16 19:20:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 20898. [2025-03-16 19:20:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20898 states, 20893 states have (on average 1.367108600966831) internal successors, (28563), 20897 states have internal predecessors, (28563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20898 states to 20898 states and 28563 transitions. [2025-03-16 19:20:53,678 INFO L78 Accepts]: Start accepts. Automaton has 20898 states and 28563 transitions. Word has length 156 [2025-03-16 19:20:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:53,678 INFO L471 AbstractCegarLoop]: Abstraction has 20898 states and 28563 transitions. [2025-03-16 19:20:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 20898 states and 28563 transitions. [2025-03-16 19:20:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 19:20:53,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:53,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:53,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:20:53,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:53,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1561612578, now seen corresponding path program 1 times [2025-03-16 19:20:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335338524] [2025-03-16 19:20:53,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:53,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:53,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 19:20:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 19:20:53,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:53,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:54,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335338524] [2025-03-16 19:20:54,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335338524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238224819] [2025-03-16 19:20:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:54,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:54,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:54,083 INFO L87 Difference]: Start difference. First operand 20898 states and 28563 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:54,156 INFO L93 Difference]: Finished difference Result 41748 states and 57057 transitions. [2025-03-16 19:20:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:54,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 19:20:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:54,190 INFO L225 Difference]: With dead ends: 41748 [2025-03-16 19:20:54,191 INFO L226 Difference]: Without dead ends: 20890 [2025-03-16 19:20:54,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:54,209 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 13 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:54,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1639 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20890 states. [2025-03-16 19:20:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20890 to 20890. [2025-03-16 19:20:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20890 states, 20885 states have (on average 1.3668661718937036) internal successors, (28547), 20889 states have internal predecessors, (28547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20890 states to 20890 states and 28547 transitions. [2025-03-16 19:20:54,435 INFO L78 Accepts]: Start accepts. Automaton has 20890 states and 28547 transitions. Word has length 156 [2025-03-16 19:20:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 20890 states and 28547 transitions. [2025-03-16 19:20:54,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20890 states and 28547 transitions. [2025-03-16 19:20:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 19:20:54,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:54,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:54,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:20:54,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:54,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1175750176, now seen corresponding path program 1 times [2025-03-16 19:20:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:54,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294870843] [2025-03-16 19:20:54,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:54,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 19:20:54,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 19:20:54,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:54,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:54,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294870843] [2025-03-16 19:20:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294870843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849946781] [2025-03-16 19:20:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:54,524 INFO L87 Difference]: Start difference. First operand 20890 states and 28547 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:54,698 INFO L93 Difference]: Finished difference Result 50882 states and 69416 transitions. [2025-03-16 19:20:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 19:20:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:54,746 INFO L225 Difference]: With dead ends: 50882 [2025-03-16 19:20:54,746 INFO L226 Difference]: Without dead ends: 31018 [2025-03-16 19:20:54,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:54,761 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 449 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:54,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1449 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31018 states. [2025-03-16 19:20:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31018 to 30970. [2025-03-16 19:20:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30970 states, 30965 states have (on average 1.3413208461165833) internal successors, (41534), 30969 states have internal predecessors, (41534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30970 states to 30970 states and 41534 transitions. [2025-03-16 19:20:55,114 INFO L78 Accepts]: Start accepts. Automaton has 30970 states and 41534 transitions. Word has length 156 [2025-03-16 19:20:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 30970 states and 41534 transitions. [2025-03-16 19:20:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30970 states and 41534 transitions. [2025-03-16 19:20:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 19:20:55,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:55,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:55,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:20:55,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1834443556, now seen corresponding path program 1 times [2025-03-16 19:20:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771863647] [2025-03-16 19:20:55,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 19:20:55,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 19:20:55,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771863647] [2025-03-16 19:20:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771863647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:55,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:55,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413955242] [2025-03-16 19:20:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:55,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:55,337 INFO L87 Difference]: Start difference. First operand 30970 states and 41534 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:55,531 INFO L93 Difference]: Finished difference Result 38752 states and 53505 transitions. [2025-03-16 19:20:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-16 19:20:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:55,572 INFO L225 Difference]: With dead ends: 38752 [2025-03-16 19:20:55,572 INFO L226 Difference]: Without dead ends: 27736 [2025-03-16 19:20:55,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:55,585 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 852 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:55,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 903 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27736 states. [2025-03-16 19:20:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27736 to 27734. [2025-03-16 19:20:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27734 states, 27729 states have (on average 1.307007104475459) internal successors, (36242), 27733 states have internal predecessors, (36242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27734 states to 27734 states and 36242 transitions. [2025-03-16 19:20:55,849 INFO L78 Accepts]: Start accepts. Automaton has 27734 states and 36242 transitions. Word has length 162 [2025-03-16 19:20:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 27734 states and 36242 transitions. [2025-03-16 19:20:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 27734 states and 36242 transitions. [2025-03-16 19:20:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 19:20:55,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:55,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:55,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:20:55,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:55,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1678927904, now seen corresponding path program 1 times [2025-03-16 19:20:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143273950] [2025-03-16 19:20:55,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:55,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 19:20:55,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 19:20:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143273950] [2025-03-16 19:20:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143273950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397466935] [2025-03-16 19:20:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:56,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:56,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:56,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:56,082 INFO L87 Difference]: Start difference. First operand 27734 states and 36242 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:56,198 INFO L93 Difference]: Finished difference Result 43766 states and 57297 transitions. [2025-03-16 19:20:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:56,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-16 19:20:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:56,233 INFO L225 Difference]: With dead ends: 43766 [2025-03-16 19:20:56,233 INFO L226 Difference]: Without dead ends: 24827 [2025-03-16 19:20:56,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:56,252 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 462 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:56,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1772 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24827 states. [2025-03-16 19:20:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24827 to 24443. [2025-03-16 19:20:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24443 states, 24438 states have (on average 1.3062443735166545) internal successors, (31922), 24442 states have internal predecessors, (31922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24443 states to 24443 states and 31922 transitions. [2025-03-16 19:20:56,707 INFO L78 Accepts]: Start accepts. Automaton has 24443 states and 31922 transitions. Word has length 162 [2025-03-16 19:20:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:56,707 INFO L471 AbstractCegarLoop]: Abstraction has 24443 states and 31922 transitions. [2025-03-16 19:20:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 24443 states and 31922 transitions. [2025-03-16 19:20:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 19:20:56,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:56,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:20:56,728 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 543357091, now seen corresponding path program 1 times [2025-03-16 19:20:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790058533] [2025-03-16 19:20:56,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 19:20:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 19:20:56,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:56,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790058533] [2025-03-16 19:20:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790058533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554933516] [2025-03-16 19:20:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:57,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:57,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:57,013 INFO L87 Difference]: Start difference. First operand 24443 states and 31922 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:57,220 INFO L93 Difference]: Finished difference Result 73895 states and 96386 transitions. [2025-03-16 19:20:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-16 19:20:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:57,287 INFO L225 Difference]: With dead ends: 73895 [2025-03-16 19:20:57,288 INFO L226 Difference]: Without dead ends: 49605 [2025-03-16 19:20:57,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:57,318 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1479 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:57,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2268 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49605 states. [2025-03-16 19:20:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49605 to 24597. [2025-03-16 19:20:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24597 states, 24592 states have (on average 1.3045299284320104) internal successors, (32081), 24596 states have internal predecessors, (32081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24597 states to 24597 states and 32081 transitions. [2025-03-16 19:20:57,850 INFO L78 Accepts]: Start accepts. Automaton has 24597 states and 32081 transitions. Word has length 164 [2025-03-16 19:20:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:57,850 INFO L471 AbstractCegarLoop]: Abstraction has 24597 states and 32081 transitions. [2025-03-16 19:20:57,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24597 states and 32081 transitions. [2025-03-16 19:20:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 19:20:57,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:57,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:20:57,873 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -507880354, now seen corresponding path program 1 times [2025-03-16 19:20:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870567186] [2025-03-16 19:20:57,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:57,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 19:20:57,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 19:20:57,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:57,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870567186] [2025-03-16 19:20:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870567186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667281482] [2025-03-16 19:20:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:57,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:57,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:57,944 INFO L87 Difference]: Start difference. First operand 24597 states and 32081 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:58,031 INFO L93 Difference]: Finished difference Result 42816 states and 55916 transitions. [2025-03-16 19:20:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-16 19:20:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:58,065 INFO L225 Difference]: With dead ends: 42816 [2025-03-16 19:20:58,066 INFO L226 Difference]: Without dead ends: 24609 [2025-03-16 19:20:58,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:58,088 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:58,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24609 states. [2025-03-16 19:20:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24609 to 24609. [2025-03-16 19:20:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24609 states, 24604 states have (on average 1.3043814013981467) internal successors, (32093), 24608 states have internal predecessors, (32093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24609 states to 24609 states and 32093 transitions. [2025-03-16 19:20:58,427 INFO L78 Accepts]: Start accepts. Automaton has 24609 states and 32093 transitions. Word has length 165 [2025-03-16 19:20:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:58,427 INFO L471 AbstractCegarLoop]: Abstraction has 24609 states and 32093 transitions. [2025-03-16 19:20:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24609 states and 32093 transitions. [2025-03-16 19:20:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 19:20:58,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:58,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:20:58,445 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1918354982, now seen corresponding path program 1 times [2025-03-16 19:20:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147908582] [2025-03-16 19:20:58,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:58,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 19:20:58,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 19:20:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147908582] [2025-03-16 19:20:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147908582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583097497] [2025-03-16 19:20:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:58,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:58,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:58,705 INFO L87 Difference]: Start difference. First operand 24609 states and 32093 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:58,806 INFO L93 Difference]: Finished difference Result 43176 states and 56317 transitions. [2025-03-16 19:20:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-16 19:20:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:58,839 INFO L225 Difference]: With dead ends: 43176 [2025-03-16 19:20:58,839 INFO L226 Difference]: Without dead ends: 25319 [2025-03-16 19:20:58,855 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-16 19:20:58,856 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 466 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:58,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1822 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25319 states. [2025-03-16 19:20:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25319 to 24879. [2025-03-16 19:20:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24879 states, 24874 states have (on average 1.3028865482029428) internal successors, (32408), 24878 states have internal predecessors, (32408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24879 states to 24879 states and 32408 transitions. [2025-03-16 19:20:59,100 INFO L78 Accepts]: Start accepts. Automaton has 24879 states and 32408 transitions. Word has length 166 [2025-03-16 19:20:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:59,100 INFO L471 AbstractCegarLoop]: Abstraction has 24879 states and 32408 transitions. [2025-03-16 19:20:59,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 24879 states and 32408 transitions. [2025-03-16 19:20:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 19:20:59,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:59,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:59,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:20:59,116 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:59,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash -865581909, now seen corresponding path program 1 times [2025-03-16 19:20:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062236764] [2025-03-16 19:20:59,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 19:20:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 19:20:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062236764] [2025-03-16 19:20:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062236764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:59,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939809225] [2025-03-16 19:20:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:59,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:59,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:59,321 INFO L87 Difference]: Start difference. First operand 24879 states and 32408 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:59,395 INFO L93 Difference]: Finished difference Result 40133 states and 52296 transitions. [2025-03-16 19:20:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-16 19:20:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:59,423 INFO L225 Difference]: With dead ends: 40133 [2025-03-16 19:20:59,424 INFO L226 Difference]: Without dead ends: 21410 [2025-03-16 19:20:59,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:59,441 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 3 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:59,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1609 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2025-03-16 19:20:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21409. [2025-03-16 19:20:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21409 states, 21404 states have (on average 1.3021397869557092) internal successors, (27871), 21408 states have internal predecessors, (27871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21409 states to 21409 states and 27871 transitions. [2025-03-16 19:20:59,658 INFO L78 Accepts]: Start accepts. Automaton has 21409 states and 27871 transitions. Word has length 166 [2025-03-16 19:20:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:59,659 INFO L471 AbstractCegarLoop]: Abstraction has 21409 states and 27871 transitions. [2025-03-16 19:20:59,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21409 states and 27871 transitions. [2025-03-16 19:20:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:20:59,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:59,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:20:59,675 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:20:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash -107699353, now seen corresponding path program 1 times [2025-03-16 19:20:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823353057] [2025-03-16 19:20:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:59,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:20:59,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:20:59,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:59,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823353057] [2025-03-16 19:21:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823353057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 19:21:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515176204] [2025-03-16 19:21:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:21:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:00,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:21:00,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:21:00,288 INFO L87 Difference]: Start difference. First operand 21409 states and 27871 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:01,450 INFO L93 Difference]: Finished difference Result 32946 states and 43165 transitions. [2025-03-16 19:21:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:21:01,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:01,483 INFO L225 Difference]: With dead ends: 32946 [2025-03-16 19:21:01,483 INFO L226 Difference]: Without dead ends: 29390 [2025-03-16 19:21:01,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:21:01,497 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 3495 mSDsluCounter, 5480 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 6214 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:01,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 6214 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:21:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29390 states. [2025-03-16 19:21:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29390 to 23753. [2025-03-16 19:21:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23753 states, 23748 states have (on average 1.292361462017854) internal successors, (30691), 23752 states have internal predecessors, (30691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23753 states to 23753 states and 30691 transitions. [2025-03-16 19:21:01,753 INFO L78 Accepts]: Start accepts. Automaton has 23753 states and 30691 transitions. Word has length 168 [2025-03-16 19:21:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 23753 states and 30691 transitions. [2025-03-16 19:21:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23753 states and 30691 transitions. [2025-03-16 19:21:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:01,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:01,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:01,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:21:01,771 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2101844059, now seen corresponding path program 1 times [2025-03-16 19:21:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731042298] [2025-03-16 19:21:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:01,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:01,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:01,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731042298] [2025-03-16 19:21:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731042298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:21:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123955982] [2025-03-16 19:21:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:21:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:03,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:21:03,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:21:03,015 INFO L87 Difference]: Start difference. First operand 23753 states and 30691 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:09,624 INFO L93 Difference]: Finished difference Result 42687 states and 58450 transitions. [2025-03-16 19:21:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-16 19:21:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:09,664 INFO L225 Difference]: With dead ends: 42687 [2025-03-16 19:21:09,664 INFO L226 Difference]: Without dead ends: 40591 [2025-03-16 19:21:09,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1159, Invalid=3953, Unknown=0, NotChecked=0, Total=5112 [2025-03-16 19:21:09,671 INFO L435 NwaCegarLoop]: 1267 mSDtfsCounter, 5213 mSDsluCounter, 14509 mSDsCounter, 0 mSdLazyCounter, 6105 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5213 SdHoareTripleChecker+Valid, 15776 SdHoareTripleChecker+Invalid, 6215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 6105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:09,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5213 Valid, 15776 Invalid, 6215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 6105 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 19:21:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40591 states. [2025-03-16 19:21:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40591 to 25151. [2025-03-16 19:21:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25151 states, 25146 states have (on average 1.2869243617275112) internal successors, (32361), 25150 states have internal predecessors, (32361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25151 states to 25151 states and 32361 transitions. [2025-03-16 19:21:09,984 INFO L78 Accepts]: Start accepts. Automaton has 25151 states and 32361 transitions. Word has length 168 [2025-03-16 19:21:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:09,984 INFO L471 AbstractCegarLoop]: Abstraction has 25151 states and 32361 transitions. [2025-03-16 19:21:09,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 25151 states and 32361 transitions. [2025-03-16 19:21:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:10,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:10,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:10,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:21:10,001 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:10,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1219933882, now seen corresponding path program 1 times [2025-03-16 19:21:10,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:10,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114101976] [2025-03-16 19:21:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:10,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:10,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:10,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:10,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114101976] [2025-03-16 19:21:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114101976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:21:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360958739] [2025-03-16 19:21:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:21:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:10,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:21:10,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:21:10,252 INFO L87 Difference]: Start difference. First operand 25151 states and 32361 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:10,483 INFO L93 Difference]: Finished difference Result 48315 states and 62401 transitions. [2025-03-16 19:21:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:10,514 INFO L225 Difference]: With dead ends: 48315 [2025-03-16 19:21:10,515 INFO L226 Difference]: Without dead ends: 25151 [2025-03-16 19:21:10,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:10,535 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 3611 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3611 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:10,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3611 Valid, 572 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25151 states. [2025-03-16 19:21:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25151 to 25151. [2025-03-16 19:21:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25151 states, 25146 states have (on average 1.2695060844667143) internal successors, (31923), 25150 states have internal predecessors, (31923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25151 states to 25151 states and 31923 transitions. [2025-03-16 19:21:10,782 INFO L78 Accepts]: Start accepts. Automaton has 25151 states and 31923 transitions. Word has length 168 [2025-03-16 19:21:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:10,782 INFO L471 AbstractCegarLoop]: Abstraction has 25151 states and 31923 transitions. [2025-03-16 19:21:10,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25151 states and 31923 transitions. [2025-03-16 19:21:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:10,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:10,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:10,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:21:10,798 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:10,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1330074981, now seen corresponding path program 1 times [2025-03-16 19:21:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062896641] [2025-03-16 19:21:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:10,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:10,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062896641] [2025-03-16 19:21:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062896641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-16 19:21:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180669986] [2025-03-16 19:21:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:12,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 19:21:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:12,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 19:21:12,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:21:12,413 INFO L87 Difference]: Start difference. First operand 25151 states and 31923 transitions. Second operand has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:15,579 INFO L93 Difference]: Finished difference Result 27749 states and 35054 transitions. [2025-03-16 19:21:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 19:21:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:15,624 INFO L225 Difference]: With dead ends: 27749 [2025-03-16 19:21:15,624 INFO L226 Difference]: Without dead ends: 27743 [2025-03-16 19:21:15,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 19:21:15,629 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 2553 mSDsluCounter, 10244 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 11027 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:15,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 11027 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:21:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27743 states. [2025-03-16 19:21:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27743 to 26262. [2025-03-16 19:21:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26262 states, 26257 states have (on average 1.26701451041627) internal successors, (33268), 26261 states have internal predecessors, (33268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26262 states to 26262 states and 33268 transitions. [2025-03-16 19:21:15,861 INFO L78 Accepts]: Start accepts. Automaton has 26262 states and 33268 transitions. Word has length 168 [2025-03-16 19:21:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 26262 states and 33268 transitions. [2025-03-16 19:21:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26262 states and 33268 transitions. [2025-03-16 19:21:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:15,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:15,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:21:15,877 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash -672556794, now seen corresponding path program 1 times [2025-03-16 19:21:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466340980] [2025-03-16 19:21:15,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:15,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:15,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:15,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:15,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466340980] [2025-03-16 19:21:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466340980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028996884] [2025-03-16 19:21:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:15,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:15,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:15,930 INFO L87 Difference]: Start difference. First operand 26262 states and 33268 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:16,216 INFO L93 Difference]: Finished difference Result 59513 states and 76448 transitions. [2025-03-16 19:21:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:16,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:16,267 INFO L225 Difference]: With dead ends: 59513 [2025-03-16 19:21:16,267 INFO L226 Difference]: Without dead ends: 43069 [2025-03-16 19:21:16,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:16,287 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 332 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:16,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1035 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43069 states. [2025-03-16 19:21:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43069 to 42492. [2025-03-16 19:21:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42492 states, 42487 states have (on average 1.2686233436109868) internal successors, (53900), 42491 states have internal predecessors, (53900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42492 states to 42492 states and 53900 transitions. [2025-03-16 19:21:16,754 INFO L78 Accepts]: Start accepts. Automaton has 42492 states and 53900 transitions. Word has length 168 [2025-03-16 19:21:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 42492 states and 53900 transitions. [2025-03-16 19:21:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42492 states and 53900 transitions. [2025-03-16 19:21:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:16,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:16,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:21:16,789 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1874913956, now seen corresponding path program 1 times [2025-03-16 19:21:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502512903] [2025-03-16 19:21:16,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:16,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:16,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:16,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502512903] [2025-03-16 19:21:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502512903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:21:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349351717] [2025-03-16 19:21:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:21:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:17,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:21:17,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:21:17,096 INFO L87 Difference]: Start difference. First operand 42492 states and 53900 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:17,574 INFO L93 Difference]: Finished difference Result 83423 states and 105989 transitions. [2025-03-16 19:21:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:17,617 INFO L225 Difference]: With dead ends: 83423 [2025-03-16 19:21:17,617 INFO L226 Difference]: Without dead ends: 42492 [2025-03-16 19:21:17,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:17,632 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 3622 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3622 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:17,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3622 Valid, 570 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42492 states. [2025-03-16 19:21:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42492 to 42492. [2025-03-16 19:21:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42492 states, 42487 states have (on average 1.2513945442135241) internal successors, (53168), 42491 states have internal predecessors, (53168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42492 states to 42492 states and 53168 transitions. [2025-03-16 19:21:18,157 INFO L78 Accepts]: Start accepts. Automaton has 42492 states and 53168 transitions. Word has length 168 [2025-03-16 19:21:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:18,157 INFO L471 AbstractCegarLoop]: Abstraction has 42492 states and 53168 transitions. [2025-03-16 19:21:18,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42492 states and 53168 transitions. [2025-03-16 19:21:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:18,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:18,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:18,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:21:18,185 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1356342297, now seen corresponding path program 1 times [2025-03-16 19:21:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999382447] [2025-03-16 19:21:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:18,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:18,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999382447] [2025-03-16 19:21:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999382447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:21:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412492494] [2025-03-16 19:21:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:21:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:18,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:21:18,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:18,793 INFO L87 Difference]: Start difference. First operand 42492 states and 53168 transitions. Second operand has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:19,726 INFO L93 Difference]: Finished difference Result 69984 states and 89941 transitions. [2025-03-16 19:21:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:21:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:19,789 INFO L225 Difference]: With dead ends: 69984 [2025-03-16 19:21:19,789 INFO L226 Difference]: Without dead ends: 64146 [2025-03-16 19:21:19,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:21:19,805 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 2455 mSDsluCounter, 5312 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2455 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:19,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2455 Valid, 6022 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:21:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64146 states. [2025-03-16 19:21:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64146 to 47346. [2025-03-16 19:21:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47346 states, 47341 states have (on average 1.246319258148328) internal successors, (59002), 47345 states have internal predecessors, (59002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47346 states to 47346 states and 59002 transitions. [2025-03-16 19:21:20,424 INFO L78 Accepts]: Start accepts. Automaton has 47346 states and 59002 transitions. Word has length 168 [2025-03-16 19:21:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 47346 states and 59002 transitions. [2025-03-16 19:21:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 47346 states and 59002 transitions. [2025-03-16 19:21:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:20,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:20,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:20,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:21:20,466 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1299083995, now seen corresponding path program 1 times [2025-03-16 19:21:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:20,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890418373] [2025-03-16 19:21:20,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:20,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:20,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:20,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:20,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890418373] [2025-03-16 19:21:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890418373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:21:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861453548] [2025-03-16 19:21:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:21:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:21:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:21:21,901 INFO L87 Difference]: Start difference. First operand 47346 states and 59002 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:26,326 INFO L93 Difference]: Finished difference Result 72549 states and 95214 transitions. [2025-03-16 19:21:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-16 19:21:26,326 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:26,399 INFO L225 Difference]: With dead ends: 72549 [2025-03-16 19:21:26,399 INFO L226 Difference]: Without dead ends: 69943 [2025-03-16 19:21:26,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=572, Invalid=1978, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 19:21:26,421 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 3990 mSDsluCounter, 13355 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3990 SdHoareTripleChecker+Valid, 14364 SdHoareTripleChecker+Invalid, 5065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:26,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3990 Valid, 14364 Invalid, 5065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 19:21:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69943 states. [2025-03-16 19:21:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69943 to 48046. [2025-03-16 19:21:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48046 states, 48041 states have (on average 1.2451031410670053) internal successors, (59816), 48045 states have internal predecessors, (59816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48046 states to 48046 states and 59816 transitions. [2025-03-16 19:21:27,182 INFO L78 Accepts]: Start accepts. Automaton has 48046 states and 59816 transitions. Word has length 168 [2025-03-16 19:21:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:27,183 INFO L471 AbstractCegarLoop]: Abstraction has 48046 states and 59816 transitions. [2025-03-16 19:21:27,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48046 states and 59816 transitions. [2025-03-16 19:21:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:27,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:27,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:27,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:21:27,212 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:27,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 993251526, now seen corresponding path program 1 times [2025-03-16 19:21:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567252751] [2025-03-16 19:21:27,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:27,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:27,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-16 19:21:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567252751] [2025-03-16 19:21:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567252751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:21:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002118745] [2025-03-16 19:21:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:21:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:21:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:21:27,426 INFO L87 Difference]: Start difference. First operand 48046 states and 59816 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:27,675 INFO L93 Difference]: Finished difference Result 73433 states and 92663 transitions. [2025-03-16 19:21:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:27,712 INFO L225 Difference]: With dead ends: 73433 [2025-03-16 19:21:27,712 INFO L226 Difference]: Without dead ends: 34125 [2025-03-16 19:21:27,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:27,739 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 3498 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3498 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:27,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3498 Valid, 570 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34125 states. [2025-03-16 19:21:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34125 to 29937. [2025-03-16 19:21:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29937 states, 29932 states have (on average 1.222972070025391) internal successors, (36606), 29936 states have internal predecessors, (36606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29937 states to 29937 states and 36606 transitions. [2025-03-16 19:21:28,205 INFO L78 Accepts]: Start accepts. Automaton has 29937 states and 36606 transitions. Word has length 168 [2025-03-16 19:21:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 29937 states and 36606 transitions. [2025-03-16 19:21:28,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29937 states and 36606 transitions. [2025-03-16 19:21:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:28,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:28,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:21:28,229 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:28,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1165537431, now seen corresponding path program 1 times [2025-03-16 19:21:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:28,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161384701] [2025-03-16 19:21:28,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:28,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:28,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:28,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:28,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161384701] [2025-03-16 19:21:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161384701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:21:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999122134] [2025-03-16 19:21:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:28,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:21:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:28,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:21:28,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:21:28,788 INFO L87 Difference]: Start difference. First operand 29937 states and 36606 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:29,646 INFO L93 Difference]: Finished difference Result 43160 states and 53707 transitions. [2025-03-16 19:21:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:21:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:29,678 INFO L225 Difference]: With dead ends: 43160 [2025-03-16 19:21:29,679 INFO L226 Difference]: Without dead ends: 39554 [2025-03-16 19:21:29,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:21:29,686 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2735 mSDsluCounter, 6936 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 7821 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:29,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2735 Valid, 7821 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:21:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39554 states. [2025-03-16 19:21:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39554 to 33470. [2025-03-16 19:21:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33470 states, 33465 states have (on average 1.216046615867324) internal successors, (40695), 33469 states have internal predecessors, (40695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33470 states to 33470 states and 40695 transitions. [2025-03-16 19:21:30,001 INFO L78 Accepts]: Start accepts. Automaton has 33470 states and 40695 transitions. Word has length 168 [2025-03-16 19:21:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:30,001 INFO L471 AbstractCegarLoop]: Abstraction has 33470 states and 40695 transitions. [2025-03-16 19:21:30,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 33470 states and 40695 transitions. [2025-03-16 19:21:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:30,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:30,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:30,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:21:30,024 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:30,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:30,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1943946597, now seen corresponding path program 1 times [2025-03-16 19:21:30,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823198639] [2025-03-16 19:21:30,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:30,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823198639] [2025-03-16 19:21:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823198639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 19:21:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334457576] [2025-03-16 19:21:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:21:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:21:30,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:21:30,574 INFO L87 Difference]: Start difference. First operand 33470 states and 40695 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:31,369 INFO L93 Difference]: Finished difference Result 52855 states and 64789 transitions. [2025-03-16 19:21:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:21:31,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:31,423 INFO L225 Difference]: With dead ends: 52855 [2025-03-16 19:21:31,423 INFO L226 Difference]: Without dead ends: 48973 [2025-03-16 19:21:31,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:21:31,443 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 3999 mSDsluCounter, 7258 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3999 SdHoareTripleChecker+Valid, 8098 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:31,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3999 Valid, 8098 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:21:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48973 states. [2025-03-16 19:21:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48973 to 37416. [2025-03-16 19:21:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37411 states have (on average 1.208227526663281) internal successors, (45201), 37415 states have internal predecessors, (45201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 45201 transitions. [2025-03-16 19:21:31,962 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 45201 transitions. Word has length 168 [2025-03-16 19:21:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:31,962 INFO L471 AbstractCegarLoop]: Abstraction has 37416 states and 45201 transitions. [2025-03-16 19:21:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 45201 transitions. [2025-03-16 19:21:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:31,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:31,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:21:31,987 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1971274345, now seen corresponding path program 1 times [2025-03-16 19:21:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678581879] [2025-03-16 19:21:31,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:31,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:32,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678581879] [2025-03-16 19:21:32,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678581879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:32,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 19:21:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613452473] [2025-03-16 19:21:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:32,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:21:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:32,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:21:32,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:21:32,428 INFO L87 Difference]: Start difference. First operand 37416 states and 45201 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:33,531 INFO L93 Difference]: Finished difference Result 63662 states and 80118 transitions. [2025-03-16 19:21:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 19:21:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:33,593 INFO L225 Difference]: With dead ends: 63662 [2025-03-16 19:21:33,593 INFO L226 Difference]: Without dead ends: 60470 [2025-03-16 19:21:33,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:21:33,607 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 3754 mSDsluCounter, 7419 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3754 SdHoareTripleChecker+Valid, 8362 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:33,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3754 Valid, 8362 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:21:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60470 states. [2025-03-16 19:21:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60470 to 42557. [2025-03-16 19:21:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42557 states, 42552 states have (on average 1.1996380898665162) internal successors, (51047), 42556 states have internal predecessors, (51047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42557 states to 42557 states and 51047 transitions. [2025-03-16 19:21:34,368 INFO L78 Accepts]: Start accepts. Automaton has 42557 states and 51047 transitions. Word has length 168 [2025-03-16 19:21:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:34,369 INFO L471 AbstractCegarLoop]: Abstraction has 42557 states and 51047 transitions. [2025-03-16 19:21:34,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42557 states and 51047 transitions. [2025-03-16 19:21:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:34,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:34,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:34,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:21:34,407 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2028132455, now seen corresponding path program 1 times [2025-03-16 19:21:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902838315] [2025-03-16 19:21:34,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:34,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:34,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:34,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902838315] [2025-03-16 19:21:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902838315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-16 19:21:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457457459] [2025-03-16 19:21:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:21:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:21:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:21:36,147 INFO L87 Difference]: Start difference. First operand 42557 states and 51047 transitions. Second operand has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:39,955 INFO L93 Difference]: Finished difference Result 50101 states and 61079 transitions. [2025-03-16 19:21:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 19:21:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:39,996 INFO L225 Difference]: With dead ends: 50101 [2025-03-16 19:21:39,996 INFO L226 Difference]: Without dead ends: 43849 [2025-03-16 19:21:40,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=311, Invalid=1171, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:21:40,008 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 1637 mSDsluCounter, 11792 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 12794 SdHoareTripleChecker+Invalid, 3965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:40,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 12794 Invalid, 3965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 19:21:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43849 states. [2025-03-16 19:21:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43849 to 42095. [2025-03-16 19:21:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42095 states, 42090 states have (on average 1.2004038964124495) internal successors, (50525), 42094 states have internal predecessors, (50525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42095 states to 42095 states and 50525 transitions. [2025-03-16 19:21:40,465 INFO L78 Accepts]: Start accepts. Automaton has 42095 states and 50525 transitions. Word has length 168 [2025-03-16 19:21:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:40,465 INFO L471 AbstractCegarLoop]: Abstraction has 42095 states and 50525 transitions. [2025-03-16 19:21:40,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42095 states and 50525 transitions. [2025-03-16 19:21:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:40,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:40,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:21:40,497 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:40,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash -200830367, now seen corresponding path program 1 times [2025-03-16 19:21:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24889537] [2025-03-16 19:21:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24889537] [2025-03-16 19:21:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24889537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-16 19:21:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468757629] [2025-03-16 19:21:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 19:21:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:41,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 19:21:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:21:41,588 INFO L87 Difference]: Start difference. First operand 42095 states and 50525 transitions. Second operand has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:45,109 INFO L93 Difference]: Finished difference Result 55236 states and 68234 transitions. [2025-03-16 19:21:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 19:21:45,109 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:45,158 INFO L225 Difference]: With dead ends: 55236 [2025-03-16 19:21:45,158 INFO L226 Difference]: Without dead ends: 53590 [2025-03-16 19:21:45,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=1825, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 19:21:45,168 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 2570 mSDsluCounter, 15003 mSDsCounter, 0 mSdLazyCounter, 5481 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 16238 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:45,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 16238 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5481 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 19:21:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53590 states. [2025-03-16 19:21:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53590 to 45033. [2025-03-16 19:21:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45033 states, 45028 states have (on average 1.1977214177844897) internal successors, (53931), 45032 states have internal predecessors, (53931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45033 states to 45033 states and 53931 transitions. [2025-03-16 19:21:45,639 INFO L78 Accepts]: Start accepts. Automaton has 45033 states and 53931 transitions. Word has length 168 [2025-03-16 19:21:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 45033 states and 53931 transitions. [2025-03-16 19:21:45,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 23 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 45033 states and 53931 transitions. [2025-03-16 19:21:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:45,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:45,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:21:45,670 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -888012829, now seen corresponding path program 1 times [2025-03-16 19:21:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106695071] [2025-03-16 19:21:45,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:45,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:45,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:45,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:45,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106695071] [2025-03-16 19:21:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106695071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:21:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358910353] [2025-03-16 19:21:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:21:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:46,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:21:46,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:21:46,080 INFO L87 Difference]: Start difference. First operand 45033 states and 53931 transitions. Second operand has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:46,895 INFO L93 Difference]: Finished difference Result 67409 states and 80922 transitions. [2025-03-16 19:21:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:21:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:46,957 INFO L225 Difference]: With dead ends: 67409 [2025-03-16 19:21:46,957 INFO L226 Difference]: Without dead ends: 64017 [2025-03-16 19:21:46,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:21:46,974 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1910 mSDsluCounter, 5270 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:46,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 5987 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:21:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64017 states. [2025-03-16 19:21:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64017 to 50736. [2025-03-16 19:21:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50736 states, 50731 states have (on average 1.1939051073308233) internal successors, (60568), 50735 states have internal predecessors, (60568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50736 states to 50736 states and 60568 transitions. [2025-03-16 19:21:47,557 INFO L78 Accepts]: Start accepts. Automaton has 50736 states and 60568 transitions. Word has length 168 [2025-03-16 19:21:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 50736 states and 60568 transitions. [2025-03-16 19:21:47,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.923076923076923) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 50736 states and 60568 transitions. [2025-03-16 19:21:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:47,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:47,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:21:47,590 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash -629847391, now seen corresponding path program 1 times [2025-03-16 19:21:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676241338] [2025-03-16 19:21:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:47,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:47,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:47,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:47,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:48,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676241338] [2025-03-16 19:21:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676241338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-16 19:21:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968528429] [2025-03-16 19:21:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:21:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:48,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:21:48,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:21:48,657 INFO L87 Difference]: Start difference. First operand 50736 states and 60568 transitions. Second operand has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:54,482 INFO L93 Difference]: Finished difference Result 65338 states and 79315 transitions. [2025-03-16 19:21:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-16 19:21:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:21:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:54,541 INFO L225 Difference]: With dead ends: 65338 [2025-03-16 19:21:54,542 INFO L226 Difference]: Without dead ends: 63261 [2025-03-16 19:21:54,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1026, Invalid=3666, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 19:21:54,556 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 4203 mSDsluCounter, 16176 mSDsCounter, 0 mSdLazyCounter, 5491 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4203 SdHoareTripleChecker+Valid, 17435 SdHoareTripleChecker+Invalid, 5604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 5491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:54,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4203 Valid, 17435 Invalid, 5604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 5491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 19:21:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63261 states. [2025-03-16 19:21:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63261 to 55322. [2025-03-16 19:21:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55322 states, 55317 states have (on average 1.1892908147585732) internal successors, (65788), 55321 states have internal predecessors, (65788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55322 states to 55322 states and 65788 transitions. [2025-03-16 19:21:55,206 INFO L78 Accepts]: Start accepts. Automaton has 55322 states and 65788 transitions. Word has length 168 [2025-03-16 19:21:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:55,207 INFO L471 AbstractCegarLoop]: Abstraction has 55322 states and 65788 transitions. [2025-03-16 19:21:55,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55322 states and 65788 transitions. [2025-03-16 19:21:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:21:55,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:55,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:55,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:21:55,249 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-16 19:21:55,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2112693023, now seen corresponding path program 1 times [2025-03-16 19:21:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:55,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115414955] [2025-03-16 19:21:55,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:55,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:55,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:21:55,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:21:55,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:55,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:56,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115414955] [2025-03-16 19:21:56,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115414955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:56,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:21:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121650676] [2025-03-16 19:21:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:56,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:21:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:56,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:21:56,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:21:56,501 INFO L87 Difference]: Start difference. First operand 55322 states and 65788 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)