./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.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_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:28:30,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:28:30,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:28:30,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:28:30,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:28:30,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:28:30,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:28:30,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:28:30,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:28:30,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:28:30,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:28:30,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:28:30,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:28:30,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:28:31,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:28:31,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:28:31,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:28:31,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:31,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:28:31,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:28:31,002 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 -> ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 [2025-03-16 19:28:31,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:28:31,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:28:31,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:28:31,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:28:31,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:28:31,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:28:32,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49723054b/a1753131892842a1bddaccb31c5d6c61/FLAGa953fa07d [2025-03-16 19:28:32,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:28:32,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:28:32,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49723054b/a1753131892842a1bddaccb31c5d6c61/FLAGa953fa07d [2025-03-16 19:28:32,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49723054b/a1753131892842a1bddaccb31c5d6c61 [2025-03-16 19:28:32,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:28:32,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:28:32,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:32,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:28:32,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:28:32,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:32" (1/1) ... [2025-03-16 19:28:32,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b8eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:32, skipping insertion in model container [2025-03-16 19:28:32,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:32" (1/1) ... [2025-03-16 19:28:32,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:28:33,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2025-03-16 19:28:33,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2025-03-16 19:28:33,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2025-03-16 19:28:33,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2025-03-16 19:28:33,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2025-03-16 19:28:33,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2025-03-16 19:28:33,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:33,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:28:33,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2025-03-16 19:28:33,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2025-03-16 19:28:33,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2025-03-16 19:28:33,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2025-03-16 19:28:33,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2025-03-16 19:28:33,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2025-03-16 19:28:33,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:33,824 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:28:33,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33 WrapperNode [2025-03-16 19:28:33,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:33,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:33,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:28:33,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:28:33,832 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:28:33" (1/1) ... [2025-03-16 19:28:33,869 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:28:33" (1/1) ... [2025-03-16 19:28:33,987 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9476 [2025-03-16 19:28:33,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:33,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:28:33,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:28:33,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:28:33,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:33,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,132 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:28:34,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:28:34,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:28:34,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:28:34,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:28:34,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (1/1) ... [2025-03-16 19:28:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:28:34,270 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:28:34,275 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:28:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:28:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:28:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:28:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:28:34,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:28:34,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:28:38,027 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12125: havoc main_~node5__m5~68#1; [2025-03-16 19:28:38,027 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10011: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-16 19:28:38,027 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8956: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~84#1;havoc main_~node5____CPAchecker_TMP_0~35#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~51#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node5__m5~5#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13451: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~135#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~36#1;havoc main_~node5____CPAchecker_TMP_0~11#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11602: havoc main_~node5__m5~65#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14245: havoc main_~node5__m5~80#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node2__m2~1#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8170: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~75#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10020: havoc main_~node5__m5~56#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15571: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~159#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13722: havoc main_~node5__m5~77#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12665: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~126#1;havoc main_~node5____CPAchecker_TMP_0~56#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3945: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~27#1; [2025-03-16 19:28:38,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5531: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~45#1; [2025-03-16 19:28:38,029 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6588: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11346: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~111#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9497: havoc main_~node5__m5~53#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13199: havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~132#1;havoc main_~node5____CPAchecker_TMP_0~59#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2365: havoc main_~check__tmp~14#1;havoc main_~node5__m5~11#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14785: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~150#1;havoc main_~node5____CPAchecker_TMP_0~68#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8708: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~81#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7651: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~69#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5802: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~48#1;havoc main_~node5____CPAchecker_TMP_0~17#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10560: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~102#1;havoc main_~node5____CPAchecker_TMP_0~44#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4483: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3426: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~21#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15319: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~156#1;havoc main_~node5____CPAchecker_TMP_0~71#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12413: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~123#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5279: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~42#1;havoc main_~node5____CPAchecker_TMP_0~14#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7922: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~72#1;havoc main_~node5____CPAchecker_TMP_0~29#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node3__m3~1#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11094: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~108#1;havoc main_~node5____CPAchecker_TMP_0~47#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L789: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~24#1;havoc main_~node5____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14533: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~147#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6342: havoc main_~node5____CPAchecker_TMP_1~20#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7399: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~66#1;havoc main_~node5____CPAchecker_TMP_0~26#1; [2025-03-16 19:28:38,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10308: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~99#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12951: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~129#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11894: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~117#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~18#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1853: havoc main_~check__tmp~10#1;havoc main_~node5__m5~7#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6876: havoc main_~node5____CPAchecker_TMP_1~23#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8462: havoc main_~node5____CPAchecker_TMP_1~32#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: havoc main_~node3__m3~5#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14014: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~141#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15071: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~153#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc main_~node5____CPAchecker_TMP_1~8#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12165: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~120#1;havoc main_~node5____CPAchecker_TMP_0~53#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8996: havoc main_~node5____CPAchecker_TMP_1~35#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9789: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~93#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node4__m4~1#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~105#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~node5____CPAchecker_TMP_1~11#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642: havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~114#1;havoc main_~node5____CPAchecker_TMP_0~50#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14285: havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~144#1;havoc main_~node5____CPAchecker_TMP_0~65#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036: havoc main_~node3__m3~6#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6094: havoc main_~node5__m5~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10060: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~96#1;havoc main_~node5____CPAchecker_TMP_0~41#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13762: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~138#1;havoc main_~node5____CPAchecker_TMP_0~62#1; [2025-03-16 19:28:38,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12705: havoc main_~node5____CPAchecker_TMP_1~56#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7156: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6628: havoc main_~node5__m5~37#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8214: havoc main_~node5__m5~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: havoc main_~node4__m4~8#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1345: havoc main_~check__tmp~5#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9537: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~90#1;havoc main_~node5____CPAchecker_TMP_0~38#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9274: havoc main_~node2__m2~4#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5046: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3989: havoc main_~node5__m5~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5575: havoc main_~node5__m5~31#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13239: havoc main_~node5____CPAchecker_TMP_1~59#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14825: havoc main_~node5____CPAchecker_TMP_1~68#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8748: havoc main_~node5__m5~49#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: havoc main_~node5____CPAchecker_TMP_1~17#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node5__m5~1#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10600: havoc main_~node5____CPAchecker_TMP_1~44#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4523: havoc main_~node5__m5~25#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7166: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc main_~node5__m5~43#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15359: havoc main_~node5____CPAchecker_TMP_1~71#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5319: havoc main_~node5____CPAchecker_TMP_1~14#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7962: havoc main_~node5____CPAchecker_TMP_1~29#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3470: havoc main_~node5__m5~19#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9284: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc main_~node4__m4~12#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11134: havoc main_~node5____CPAchecker_TMP_1~47#1; [2025-03-16 19:28:38,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11399: havoc main_~node3__m3~9#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12457: havoc main_~node5__m5~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3737: havoc main_~node5____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7439: havoc main_~node5____CPAchecker_TMP_1~26#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7176: havoc main_~node4__m4~15#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13519: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12991: havoc main_~node5__m5~73#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14577: havoc main_~node5__m5~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6386: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~55#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: havoc main_~node3__m3~8#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10352: havoc main_~node5__m5~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11409: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11938: havoc main_~node5__m5~67#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node2__m2~3#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15111: havoc main_~node5__m5~85#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12205: havoc main_~node5____CPAchecker_TMP_1~53#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8506: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~79#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-16 19:28:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10886: havoc main_~node5__m5~61#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13529: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14058: havoc main_~node5__m5~79#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4281: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~31#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5075: havoc main_~node5__m5~28#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11682: havoc main_~node5____CPAchecker_TMP_1~50#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14325: havoc main_~node5____CPAchecker_TMP_1~65#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9040: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~85#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9833: havoc main_~node5__m5~55#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11419: havoc main_~node4__m4~21#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6134: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~52#1;havoc main_~node5____CPAchecker_TMP_0~19#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10100: havoc main_~node5____CPAchecker_TMP_1~41#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4815: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~37#1; [2025-03-16 19:28:38,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7195: havoc main_~node5__m5~40#1; [2025-03-16 19:28:38,036 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13802: havoc main_~node5____CPAchecker_TMP_1~62#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6668: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node5____CPAchecker_TMP_0~22#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13539: havoc main_~node4__m4~24#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8254: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~76#1;havoc main_~node5____CPAchecker_TMP_0~31#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9577: havoc main_~node5____CPAchecker_TMP_1~38#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12749: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~127#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9314: havoc main_~node4__m4~18#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2179: havoc main_~node3__m3~4#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4029: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~28#1;havoc main_~node5____CPAchecker_TMP_0~7#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~46#1;havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: havoc main_~node4__m4~7#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11429: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8788: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~82#1;havoc main_~node5____CPAchecker_TMP_0~34#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2710: havoc main_~check__tmp~16#1;havoc main_~node5__m5~14#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13283: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~133#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14869: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~151#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4563: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~34#1;havoc main_~node5____CPAchecker_TMP_0~10#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7735: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~70#1;havoc main_~node5____CPAchecker_TMP_0~28#1; [2025-03-16 19:28:38,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13549: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5886: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~49#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10644: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~103#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~22#1;havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9324: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11438: havoc main_~node5__m5~64#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~157#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12497: havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~124#1;havoc main_~node5____CPAchecker_TMP_0~55#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5363: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~43#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8006: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~73#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11178: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~109#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13558: havoc main_~node5__m5~76#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1138: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3781: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~25#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1667: havoc main_~node3__m3~3#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~node4__m4~6#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4__m4~5#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L875: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13031: havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~130#1;havoc main_~node5____CPAchecker_TMP_0~58#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14617: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~148#1;havoc main_~node5____CPAchecker_TMP_0~67#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~67#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9333: havoc main_~node5__m5~52#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10392: havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~100#1;havoc main_~node5____CPAchecker_TMP_0~43#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11978: havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~118#1;havoc main_~node5____CPAchecker_TMP_0~52#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~19#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15151: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~154#1;havoc main_~node5____CPAchecker_TMP_0~70#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10926: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~106#1;havoc main_~node5____CPAchecker_TMP_0~46#1; [2025-03-16 19:28:38,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14098: havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~142#1;havoc main_~node5____CPAchecker_TMP_0~64#1; [2025-03-16 19:28:38,039 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12249: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~121#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6964: havoc main_~node5__m5~39#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5115: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1;havoc main_~node5____CPAchecker_TMP_0~13#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1416: havoc main_~node4__m4~3#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9873: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~94#1;havoc main_~node5____CPAchecker_TMP_0~40#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6174: havoc main_~node5____CPAchecker_TMP_1~19#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1684: havoc main_~node4__m4~4#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11726: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~115#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2213: havoc main_~node5__m5~10#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9084: havoc main_~node5__m5~51#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14369: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~145#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node2__m2~2#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7235: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~64#1;havoc main_~node5____CPAchecker_TMP_0~25#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6708: havoc main_~node5____CPAchecker_TMP_1~22#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8294: havoc main_~node5____CPAchecker_TMP_1~31#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4859: havoc main_~node5__m5~27#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10144: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~97#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6445: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13846: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~139#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4069: havoc main_~node5____CPAchecker_TMP_1~7#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5655: havoc main_~node5____CPAchecker_TMP_1~16#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8828: havoc main_~node5____CPAchecker_TMP_1~34#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9621: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~91#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8565: havoc main_~node4__m4~17#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: havoc main_~check__tmp~15#1;havoc main_~node5__m5~12#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L903: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4603: havoc main_~node5____CPAchecker_TMP_1~10#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7775: havoc main_~node5____CPAchecker_TMP_1~28#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: havoc main_~node5__m5~4#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4340: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5926: havoc main_~node5__m5~33#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6455: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13327: havoc main_~node5__m5~75#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: havoc main_~node5____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11478: havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~112#1;havoc main_~node5____CPAchecker_TMP_0~49#1; [2025-03-16 19:28:38,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: havoc main_~node5__m5~6#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12537: havoc main_~node5____CPAchecker_TMP_1~55#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~node3__m3~2#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8046: havoc main_~node5__m5~45#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8575: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15447: havoc main_~node5__m5~87#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13598: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~136#1;havoc main_~node5____CPAchecker_TMP_0~61#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: havoc main_~node5__m5~15#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: havoc main_~node5__m5~21#1; [2025-03-16 19:28:38,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc main_~node5__m5~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4350: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6464: havoc main_~node5__m5~36#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13071: havoc main_~node5____CPAchecker_TMP_1~58#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14657: havoc main_~node5____CPAchecker_TMP_1~67#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11222: havoc main_~node5__m5~63#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12808: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9373: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~88#1;havoc main_~node5____CPAchecker_TMP_0~37#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10432: havoc main_~node5____CPAchecker_TMP_1~43#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc main_~check__tmp~11#1;havoc main_~node5__m5~8#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12018: havoc main_~node5____CPAchecker_TMP_1~52#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: havoc main_~node3__m3~0#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7527: havoc main_~node5__m5~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8584: havoc main_~node5__m5~48#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15191: havoc main_~node5____CPAchecker_TMP_1~70#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14928: havoc main_~node4__m4~26#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4359: havoc main_~node5__m5~24#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: havoc main_~node5__m5~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10966: havoc main_~node5____CPAchecker_TMP_1~46#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14138: havoc main_~node5____CPAchecker_TMP_1~64#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10703: havoc main_~node4__m4~20#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12289: havoc main_~node5__m5~69#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7004: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1;havoc main_~node5____CPAchecker_TMP_0~24#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12818: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5155: havoc main_~node5____CPAchecker_TMP_1~13#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node4__m4~2#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9913: havoc main_~node5____CPAchecker_TMP_1~40#1; [2025-03-16 19:28:38,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9124: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~86#1;havoc main_~node5____CPAchecker_TMP_0~36#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14409: havoc main_~node5__m5~81#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14938: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6218: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~53#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7275: havoc main_~node5____CPAchecker_TMP_1~25#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1;havoc main_~node5____CPAchecker_TMP_0~12#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10184: havoc main_~node5__m5~57#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12827: havoc main_~node5__m5~72#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11770: havoc main_~node5__m5~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10713: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6752: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8338: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~77#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node4__m4~0#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13890: havoc main_~node5__m5~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14947: havoc main_~node5__m5~84#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4113: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~29#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5699: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~47#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10722: havoc main_~node5__m5~60#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8872: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~83#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9665: havoc main_~node5__m5~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5966: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~50#1;havoc main_~node5____CPAchecker_TMP_0~18#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13367: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~134#1;havoc main_~node5____CPAchecker_TMP_0~60#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5__m5~2#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4647: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11518: havoc main_~node5____CPAchecker_TMP_1~49#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7819: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~71#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8086: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~74#1;havoc main_~node5____CPAchecker_TMP_0~30#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~23#1; [2025-03-16 19:28:38,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15487: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~158#1;havoc main_~node5____CPAchecker_TMP_0~72#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12581: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~125#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13638: havoc main_~node5____CPAchecker_TMP_1~61#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~26#1;havoc main_~node5____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5447: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~44#1;havoc main_~node5____CPAchecker_TMP_0~15#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6504: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~56#1;havoc main_~node5____CPAchecker_TMP_0~21#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11262: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~110#1;havoc main_~node5____CPAchecker_TMP_0~48#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: havoc main_~node5__m5~13#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9413: havoc main_~node5____CPAchecker_TMP_1~37#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L430: havoc main_~node5__m5~0#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13115: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~131#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14701: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~149#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7567: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~68#1;havoc main_~node5____CPAchecker_TMP_0~27#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8624: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~80#1;havoc main_~node5____CPAchecker_TMP_0~33#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10476: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~101#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12062: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~119#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~32#1;havoc main_~node5____CPAchecker_TMP_0~9#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~20#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15235: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~155#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12329: havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~122#1;havoc main_~node5____CPAchecker_TMP_0~54#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7044: havoc main_~node5____CPAchecker_TMP_1~24#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11010: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~107#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14182: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~143#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2292: havoc main_~check__tmp~13#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5199: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~41#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9164: havoc main_~node5____CPAchecker_TMP_1~36#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14449: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~146#1;havoc main_~node5____CPAchecker_TMP_0~66#1; [2025-03-16 19:28:38,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9957: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~95#1; [2025-03-16 19:28:38,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: havoc main_~node5__m5~9#1; [2025-03-16 19:28:38,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4939: havoc main_~node5____CPAchecker_TMP_1~12#1; [2025-03-16 19:28:38,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10224: havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~98#1;havoc main_~node5____CPAchecker_TMP_0~42#1; [2025-03-16 19:28:38,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12867: havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~128#1;havoc main_~node5____CPAchecker_TMP_0~57#1; [2025-03-16 19:28:38,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11810: havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~116#1;havoc main_~node5____CPAchecker_TMP_0~51#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6262: havoc main_~node5__m5~35#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7319: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~65#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~17#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13930: havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~140#1;havoc main_~node5____CPAchecker_TMP_0~63#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14987: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~152#1;havoc main_~node5____CPAchecker_TMP_0~69#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6796: havoc main_~node5__m5~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8382: havoc main_~node5__m5~47#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1512: havoc main_~check__tmp~7#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10762: havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~104#1;havoc main_~node5____CPAchecker_TMP_0~45#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9705: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~92#1;havoc main_~node5____CPAchecker_TMP_0~39#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node5____CPAchecker_TMP_1~18#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4157: havoc main_~node5__m5~23#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5743: havoc main_~node4__m4~13#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13407: havoc main_~node5____CPAchecker_TMP_1~60#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780: havoc main_~check__tmp~9#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8916: havoc main_~node5__m5~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8126: havoc main_~node5____CPAchecker_TMP_1~30#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4691: havoc main_~node5__m5~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11562: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~113#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7863: havoc main_~node4__m4~16#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15527: havoc main_~node5____CPAchecker_TMP_1~72#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3901: havoc main_~node5____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5487: havoc main_~node5____CPAchecker_TMP_1~15#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6544: havoc main_~node5____CPAchecker_TMP_1~21#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3638: havoc main_~node4__m4~10#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11302: havoc main_~node5____CPAchecker_TMP_1~48#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5753: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13682: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~137#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12625: havoc main_~node5__m5~71#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7607: havoc main_~node5____CPAchecker_TMP_1~27#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8664: havoc main_~node5____CPAchecker_TMP_1~33#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9457: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~89#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: havoc main_~node5__m5~3#1; [2025-03-16 19:28:38,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7873: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13159: havoc main_~node5__m5~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4439: havoc main_~node5____CPAchecker_TMP_1~9#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3382: havoc main_~node5____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14745: havoc main_~node5__m5~83#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5762: havoc main_~node5__m5~32#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3648: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12369: havoc main_~node5____CPAchecker_TMP_1~54#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10520: havoc main_~node5__m5~59#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12106: havoc main_~node4__m4~22#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15279: havoc main_~node5__m5~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7088: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~63#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L482: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5239: havoc main_~node5__m5~29#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7882: havoc main_~node5__m5~44#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14489: havoc main_~node5____CPAchecker_TMP_1~66#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11054: havoc main_~node5__m5~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14226: havoc main_~node4__m4~25#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc main_~node5__m5~16#1;havoc main_~node4__m4~9#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: havoc main_~node5__m5~20#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10264: havoc main_~node5____CPAchecker_TMP_1~42#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12907: havoc main_~node5____CPAchecker_TMP_1~57#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11850: havoc main_~node5____CPAchecker_TMP_1~51#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9208: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~87#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10001: havoc main_~node4__m4~19#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6302: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~54#1;havoc main_~node5____CPAchecker_TMP_0~20#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7359: havoc main_~node5__m5~41#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12116: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4983: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: havoc main_~node5__m5~17#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13970: havoc main_~node5____CPAchecker_TMP_1~63#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15027: havoc main_~node5____CPAchecker_TMP_1~69#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6836: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1;havoc main_~node5____CPAchecker_TMP_0~23#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8422: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~78#1;havoc main_~node5____CPAchecker_TMP_0~32#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14236: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-16 19:28:38,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10802: havoc main_~node5____CPAchecker_TMP_1~45#1; [2025-03-16 19:28:38,051 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9745: havoc main_~node5____CPAchecker_TMP_1~39#1; [2025-03-16 19:28:38,051 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4197: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~30#1;havoc main_~node5____CPAchecker_TMP_0~8#1; [2025-03-16 19:28:38,355 INFO L? ?]: Removed 1319 outVars from TransFormulas that were not future-live. [2025-03-16 19:28:38,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:28:38,394 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:28:38,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:28:38,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:38 BoogieIcfgContainer [2025-03-16 19:28:38,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:28:38,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:28:38,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:28:38,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:28:38,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:28:32" (1/3) ... [2025-03-16 19:28:38,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7bcf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:38, skipping insertion in model container [2025-03-16 19:28:38,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:33" (2/3) ... [2025-03-16 19:28:38,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7bcf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:38, skipping insertion in model container [2025-03-16 19:28:38,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:38" (3/3) ... [2025-03-16 19:28:38,403 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:28:38,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:28:38,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1750 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-16 19:28:38,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:28:38,510 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;@6403cc2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:28:38,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-16 19:28:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 1750 states, 1743 states have (on average 1.8009179575444636) internal successors, (3139), 1749 states have internal predecessors, (3139), 0 states have call successors, (0), 0 states 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:28:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:28:38,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:38,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:38,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:38,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2060224836, now seen corresponding path program 1 times [2025-03-16 19:28:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:38,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521119937] [2025-03-16 19:28:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:28:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:28:38,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,107 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:28:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521119937] [2025-03-16 19:28:39,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521119937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820613029] [2025-03-16 19:28:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:39,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:39,135 INFO L87 Difference]: Start difference. First operand has 1750 states, 1743 states have (on average 1.8009179575444636) internal successors, (3139), 1749 states have internal predecessors, (3139), 0 states have call successors, (0), 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 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,272 INFO L93 Difference]: Finished difference Result 2318 states and 4088 transitions. [2025-03-16 19:28:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:28:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,291 INFO L225 Difference]: With dead ends: 2318 [2025-03-16 19:28:39,291 INFO L226 Difference]: Without dead ends: 1974 [2025-03-16 19:28:39,296 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:28:39,297 INFO L435 NwaCegarLoop]: 3161 mSDtfsCounter, 1597 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 5040 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 5040 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-16 19:28:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1964. [2025-03-16 19:28:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1958 states have (on average 1.3534218590398366) internal successors, (2650), 1963 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states 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:28:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2650 transitions. [2025-03-16 19:28:39,390 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2650 transitions. Word has length 74 [2025-03-16 19:28:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:39,392 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2650 transitions. [2025-03-16 19:28:39,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2650 transitions. [2025-03-16 19:28:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:28:39,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:39,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:39,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:28:39,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:39,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1573792760, now seen corresponding path program 1 times [2025-03-16 19:28:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453967835] [2025-03-16 19:28:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:39,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:28:39,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:28:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,585 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:28:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453967835] [2025-03-16 19:28:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453967835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608170735] [2025-03-16 19:28:39,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:39,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:39,587 INFO L87 Difference]: Start difference. First operand 1964 states and 2650 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,812 INFO L93 Difference]: Finished difference Result 3034 states and 4108 transitions. [2025-03-16 19:28:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:28:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,821 INFO L225 Difference]: With dead ends: 3034 [2025-03-16 19:28:39,822 INFO L226 Difference]: Without dead ends: 2708 [2025-03-16 19:28:39,825 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:28:39,826 INFO L435 NwaCegarLoop]: 2588 mSDtfsCounter, 1325 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 4069 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-03-16 19:28:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2698. [2025-03-16 19:28:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2692 states have (on average 1.3346953937592867) internal successors, (3593), 2697 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states 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:28:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3593 transitions. [2025-03-16 19:28:39,903 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3593 transitions. Word has length 74 [2025-03-16 19:28:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 2698 states and 3593 transitions. [2025-03-16 19:28:39,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3593 transitions. [2025-03-16 19:28:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:28:39,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:39,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:39,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:28:39,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1122822644, now seen corresponding path program 1 times [2025-03-16 19:28:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:39,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381141765] [2025-03-16 19:28:39,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:28:39,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:28:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:40,063 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:28:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381141765] [2025-03-16 19:28:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381141765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445231388] [2025-03-16 19:28:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:40,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:40,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:40,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:40,067 INFO L87 Difference]: Start difference. First operand 2698 states and 3593 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:40,164 INFO L93 Difference]: Finished difference Result 4225 states and 5858 transitions. [2025-03-16 19:28:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:28:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:40,176 INFO L225 Difference]: With dead ends: 4225 [2025-03-16 19:28:40,176 INFO L226 Difference]: Without dead ends: 3450 [2025-03-16 19:28:40,178 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:28:40,180 INFO L435 NwaCegarLoop]: 2344 mSDtfsCounter, 1183 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3767 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:40,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 3767 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2025-03-16 19:28:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3440. [2025-03-16 19:28:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3434 states have (on average 1.3613861386138615) internal successors, (4675), 3439 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states 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:28:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4675 transitions. [2025-03-16 19:28:40,241 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4675 transitions. Word has length 74 [2025-03-16 19:28:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 4675 transitions. [2025-03-16 19:28:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4675 transitions. [2025-03-16 19:28:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:28:40,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:40,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:28:40,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1585250565, now seen corresponding path program 1 times [2025-03-16 19:28:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924961641] [2025-03-16 19:28:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:40,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:28:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:28:40,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:40,448 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:28:40,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:40,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924961641] [2025-03-16 19:28:40,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924961641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:40,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:40,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831989012] [2025-03-16 19:28:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:40,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:40,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:40,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:40,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:40,449 INFO L87 Difference]: Start difference. First operand 3440 states and 4675 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:41,311 INFO L93 Difference]: Finished difference Result 6902 states and 9679 transitions. [2025-03-16 19:28:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:41,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:28:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:41,323 INFO L225 Difference]: With dead ends: 6902 [2025-03-16 19:28:41,323 INFO L226 Difference]: Without dead ends: 4063 [2025-03-16 19:28:41,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:41,328 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 5807 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5807 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:41,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5807 Valid, 1210 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2025-03-16 19:28:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4053. [2025-03-16 19:28:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 4047 states have (on average 1.412898443291327) internal successors, (5718), 4052 states have internal predecessors, (5718), 0 states have call successors, (0), 0 states 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:28:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5718 transitions. [2025-03-16 19:28:41,397 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5718 transitions. Word has length 74 [2025-03-16 19:28:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:41,397 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 5718 transitions. [2025-03-16 19:28:41,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5718 transitions. [2025-03-16 19:28:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:28:41,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:41,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:41,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:28:41,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:41,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1823112484, now seen corresponding path program 1 times [2025-03-16 19:28:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702324997] [2025-03-16 19:28:41,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:41,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:28:41,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:28:41,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:41,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:41,534 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:28:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702324997] [2025-03-16 19:28:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702324997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665690930] [2025-03-16 19:28:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:41,537 INFO L87 Difference]: Start difference. First operand 4053 states and 5718 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,261 INFO L93 Difference]: Finished difference Result 9301 states and 13405 transitions. [2025-03-16 19:28:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:28:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,276 INFO L225 Difference]: With dead ends: 9301 [2025-03-16 19:28:42,277 INFO L226 Difference]: Without dead ends: 5689 [2025-03-16 19:28:42,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:42,282 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 4627 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4627 Valid, 989 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5689 states. [2025-03-16 19:28:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5689 to 5679. [2025-03-16 19:28:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5673 states have (on average 1.442799224396263) internal successors, (8185), 5678 states have internal predecessors, (8185), 0 states have call successors, (0), 0 states 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:28:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 8185 transitions. [2025-03-16 19:28:42,372 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 8185 transitions. Word has length 75 [2025-03-16 19:28:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:42,372 INFO L471 AbstractCegarLoop]: Abstraction has 5679 states and 8185 transitions. [2025-03-16 19:28:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 8185 transitions. [2025-03-16 19:28:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:28:42,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:42,376 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] [2025-03-16 19:28:42,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:28:42,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:42,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash -583188701, now seen corresponding path program 1 times [2025-03-16 19:28:42,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:42,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599541832] [2025-03-16 19:28:42,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:28:42,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:28:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:42,447 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:28:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599541832] [2025-03-16 19:28:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599541832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632107964] [2025-03-16 19:28:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:42,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:42,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:42,448 INFO L87 Difference]: Start difference. First operand 5679 states and 8185 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,514 INFO L93 Difference]: Finished difference Result 11935 states and 17376 transitions. [2025-03-16 19:28:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:28:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,536 INFO L225 Difference]: With dead ends: 11935 [2025-03-16 19:28:42,536 INFO L226 Difference]: Without dead ends: 8015 [2025-03-16 19:28:42,542 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:28:42,542 INFO L435 NwaCegarLoop]: 1761 mSDtfsCounter, 1094 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2701 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8015 states. [2025-03-16 19:28:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8015 to 7989. [2025-03-16 19:28:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7989 states, 7983 states have (on average 1.4280345734686208) internal successors, (11400), 7988 states have internal predecessors, (11400), 0 states have call successors, (0), 0 states 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:28:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7989 states to 7989 states and 11400 transitions. [2025-03-16 19:28:42,713 INFO L78 Accepts]: Start accepts. Automaton has 7989 states and 11400 transitions. Word has length 76 [2025-03-16 19:28:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 7989 states and 11400 transitions. [2025-03-16 19:28:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7989 states and 11400 transitions. [2025-03-16 19:28:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:28:42,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:42,720 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] [2025-03-16 19:28:42,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:28:42,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:42,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash -74411583, now seen corresponding path program 1 times [2025-03-16 19:28:42,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:42,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316682686] [2025-03-16 19:28:42,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:42,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:28:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:28:42,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:42,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:42,807 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:28:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316682686] [2025-03-16 19:28:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316682686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:42,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55660938] [2025-03-16 19:28:42,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:42,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:42,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:42,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:42,809 INFO L87 Difference]: Start difference. First operand 7989 states and 11400 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,865 INFO L93 Difference]: Finished difference Result 16753 states and 24120 transitions. [2025-03-16 19:28:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:28:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,887 INFO L225 Difference]: With dead ends: 16753 [2025-03-16 19:28:42,887 INFO L226 Difference]: Without dead ends: 11162 [2025-03-16 19:28:42,895 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:28:42,896 INFO L435 NwaCegarLoop]: 1778 mSDtfsCounter, 1112 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 2713 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11162 states. [2025-03-16 19:28:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11162 to 11128. [2025-03-16 19:28:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11128 states, 11122 states have (on average 1.4129652940118684) internal successors, (15715), 11127 states have internal predecessors, (15715), 0 states have call successors, (0), 0 states 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:28:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11128 states to 11128 states and 15715 transitions. [2025-03-16 19:28:43,128 INFO L78 Accepts]: Start accepts. Automaton has 11128 states and 15715 transitions. Word has length 76 [2025-03-16 19:28:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:43,128 INFO L471 AbstractCegarLoop]: Abstraction has 11128 states and 15715 transitions. [2025-03-16 19:28:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 11128 states and 15715 transitions. [2025-03-16 19:28:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:28:43,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:43,141 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] [2025-03-16 19:28:43,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:28:43,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -938608139, now seen corresponding path program 1 times [2025-03-16 19:28:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492161665] [2025-03-16 19:28:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:43,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:28:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:28:43,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:43,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:43,294 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:28:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:43,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492161665] [2025-03-16 19:28:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492161665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:43,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834426392] [2025-03-16 19:28:43,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:43,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:43,296 INFO L87 Difference]: Start difference. First operand 11128 states and 15715 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:43,933 INFO L93 Difference]: Finished difference Result 24319 states and 34640 transitions. [2025-03-16 19:28:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:43,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:28:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:43,956 INFO L225 Difference]: With dead ends: 24319 [2025-03-16 19:28:43,956 INFO L226 Difference]: Without dead ends: 14156 [2025-03-16 19:28:43,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:43,963 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 3965 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3965 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:43,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3965 Valid, 860 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2025-03-16 19:28:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 14110. [2025-03-16 19:28:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14110 states, 14104 states have (on average 1.41626488939308) internal successors, (19975), 14109 states have internal predecessors, (19975), 0 states have call successors, (0), 0 states 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:28:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14110 states to 14110 states and 19975 transitions. [2025-03-16 19:28:44,166 INFO L78 Accepts]: Start accepts. Automaton has 14110 states and 19975 transitions. Word has length 76 [2025-03-16 19:28:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:44,167 INFO L471 AbstractCegarLoop]: Abstraction has 14110 states and 19975 transitions. [2025-03-16 19:28:44,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:28:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14110 states and 19975 transitions. [2025-03-16 19:28:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:44,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:44,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:44,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:28:44,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2107292834, now seen corresponding path program 1 times [2025-03-16 19:28:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461425990] [2025-03-16 19:28:44,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:44,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:44,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:44,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:44,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:44,443 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:28:44,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461425990] [2025-03-16 19:28:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461425990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:44,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:44,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:44,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816844450] [2025-03-16 19:28:44,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:44,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:44,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:44,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:44,445 INFO L87 Difference]: Start difference. First operand 14110 states and 19975 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:45,327 INFO L93 Difference]: Finished difference Result 29930 states and 42979 transitions. [2025-03-16 19:28:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:45,374 INFO L225 Difference]: With dead ends: 29930 [2025-03-16 19:28:45,374 INFO L226 Difference]: Without dead ends: 25586 [2025-03-16 19:28:45,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:45,387 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 5181 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:45,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 1756 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2025-03-16 19:28:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 14158. [2025-03-16 19:28:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14152 states have (on average 1.415983606557377) internal successors, (20039), 14157 states have internal predecessors, (20039), 0 states have call successors, (0), 0 states 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:28:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 20039 transitions. [2025-03-16 19:28:45,729 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 20039 transitions. Word has length 77 [2025-03-16 19:28:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:45,729 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 20039 transitions. [2025-03-16 19:28:45,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 20039 transitions. [2025-03-16 19:28:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:45,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:45,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:45,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:28:45,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 128335915, now seen corresponding path program 1 times [2025-03-16 19:28:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155296835] [2025-03-16 19:28:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:45,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:45,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:45,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:45,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:45,921 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:28:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:45,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155296835] [2025-03-16 19:28:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155296835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511207875] [2025-03-16 19:28:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:45,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:45,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:45,923 INFO L87 Difference]: Start difference. First operand 14158 states and 20039 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:46,637 INFO L93 Difference]: Finished difference Result 34906 states and 50276 transitions. [2025-03-16 19:28:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:46,676 INFO L225 Difference]: With dead ends: 34906 [2025-03-16 19:28:46,676 INFO L226 Difference]: Without dead ends: 29286 [2025-03-16 19:28:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:46,689 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 5081 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5081 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:46,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5081 Valid, 1725 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29286 states. [2025-03-16 19:28:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29286 to 14338. [2025-03-16 19:28:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14338 states, 14332 states have (on average 1.4149455763326821) internal successors, (20279), 14337 states have internal predecessors, (20279), 0 states have call successors, (0), 0 states 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:28:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 20279 transitions. [2025-03-16 19:28:47,041 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 20279 transitions. Word has length 77 [2025-03-16 19:28:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:47,041 INFO L471 AbstractCegarLoop]: Abstraction has 14338 states and 20279 transitions. [2025-03-16 19:28:47,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 20279 transitions. [2025-03-16 19:28:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:47,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:47,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:47,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:28:47,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1143085129, now seen corresponding path program 1 times [2025-03-16 19:28:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339515126] [2025-03-16 19:28:47,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:47,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:47,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:47,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:47,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:47,199 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:28:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339515126] [2025-03-16 19:28:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339515126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595108536] [2025-03-16 19:28:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:47,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:47,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:47,200 INFO L87 Difference]: Start difference. First operand 14338 states and 20279 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:47,936 INFO L93 Difference]: Finished difference Result 32592 states and 46875 transitions. [2025-03-16 19:28:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:47,967 INFO L225 Difference]: With dead ends: 32592 [2025-03-16 19:28:47,968 INFO L226 Difference]: Without dead ends: 27258 [2025-03-16 19:28:47,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:47,980 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 5036 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5036 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:47,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5036 Valid, 1700 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27258 states. [2025-03-16 19:28:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27258 to 14638. [2025-03-16 19:28:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14638 states, 14632 states have (on average 1.4135456533624933) internal successors, (20683), 14637 states have internal predecessors, (20683), 0 states have call successors, (0), 0 states 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:28:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14638 states to 14638 states and 20683 transitions. [2025-03-16 19:28:48,305 INFO L78 Accepts]: Start accepts. Automaton has 14638 states and 20683 transitions. Word has length 77 [2025-03-16 19:28:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 14638 states and 20683 transitions. [2025-03-16 19:28:48,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14638 states and 20683 transitions. [2025-03-16 19:28:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:48,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:48,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:48,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:28:48,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:48,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1142397479, now seen corresponding path program 1 times [2025-03-16 19:28:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525002772] [2025-03-16 19:28:48,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:48,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:48,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:48,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:48,414 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:28:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525002772] [2025-03-16 19:28:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525002772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203677149] [2025-03-16 19:28:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:48,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:48,416 INFO L87 Difference]: Start difference. First operand 14638 states and 20683 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:48,992 INFO L93 Difference]: Finished difference Result 33516 states and 47577 transitions. [2025-03-16 19:28:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:49,015 INFO L225 Difference]: With dead ends: 33516 [2025-03-16 19:28:49,015 INFO L226 Difference]: Without dead ends: 19748 [2025-03-16 19:28:49,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:49,024 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 4144 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:49,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 911 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19748 states. [2025-03-16 19:28:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19748 to 14638. [2025-03-16 19:28:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14638 states, 14632 states have (on average 1.4097867687260799) internal successors, (20628), 14637 states have internal predecessors, (20628), 0 states have call successors, (0), 0 states 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:28:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14638 states to 14638 states and 20628 transitions. [2025-03-16 19:28:49,229 INFO L78 Accepts]: Start accepts. Automaton has 14638 states and 20628 transitions. Word has length 78 [2025-03-16 19:28:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:49,229 INFO L471 AbstractCegarLoop]: Abstraction has 14638 states and 20628 transitions. [2025-03-16 19:28:49,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14638 states and 20628 transitions. [2025-03-16 19:28:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:49,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:49,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:49,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:28:49,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1108611286, now seen corresponding path program 1 times [2025-03-16 19:28:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121811414] [2025-03-16 19:28:49,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:49,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:49,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:49,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:49,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:49,560 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:28:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121811414] [2025-03-16 19:28:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121811414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:49,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574098456] [2025-03-16 19:28:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:49,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:49,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:49,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:49,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:49,561 INFO L87 Difference]: Start difference. First operand 14638 states and 20628 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:49,602 INFO L93 Difference]: Finished difference Result 14638 states and 20628 transitions. [2025-03-16 19:28:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:49,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:49,617 INFO L225 Difference]: With dead ends: 14638 [2025-03-16 19:28:49,617 INFO L226 Difference]: Without dead ends: 14636 [2025-03-16 19:28:49,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:49,623 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 0 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3518 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:49,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3518 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14636 states. [2025-03-16 19:28:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14636 to 14636. [2025-03-16 19:28:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14636 states, 14631 states have (on average 1.4073542478299501) internal successors, (20591), 14635 states have internal predecessors, (20591), 0 states have call successors, (0), 0 states 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:28:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14636 states to 14636 states and 20591 transitions. [2025-03-16 19:28:49,764 INFO L78 Accepts]: Start accepts. Automaton has 14636 states and 20591 transitions. Word has length 78 [2025-03-16 19:28:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 14636 states and 20591 transitions. [2025-03-16 19:28:49,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14636 states and 20591 transitions. [2025-03-16 19:28:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:49,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:49,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:28:49,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -336971677, now seen corresponding path program 1 times [2025-03-16 19:28:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320268816] [2025-03-16 19:28:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:49,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:49,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,000 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:28:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320268816] [2025-03-16 19:28:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320268816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297848182] [2025-03-16 19:28:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:50,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:50,004 INFO L87 Difference]: Start difference. First operand 14636 states and 20591 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,089 INFO L93 Difference]: Finished difference Result 14636 states and 20591 transitions. [2025-03-16 19:28:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,101 INFO L225 Difference]: With dead ends: 14636 [2025-03-16 19:28:50,101 INFO L226 Difference]: Without dead ends: 14634 [2025-03-16 19:28:50,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:28:50,105 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 0 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3512 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3512 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14634 states. [2025-03-16 19:28:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14634 to 14634. [2025-03-16 19:28:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14634 states, 14630 states have (on average 1.4049213943950787) internal successors, (20554), 14633 states have internal predecessors, (20554), 0 states have call successors, (0), 0 states 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:28:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 20554 transitions. [2025-03-16 19:28:50,308 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 20554 transitions. Word has length 78 [2025-03-16 19:28:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,308 INFO L471 AbstractCegarLoop]: Abstraction has 14634 states and 20554 transitions. [2025-03-16 19:28:50,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 20554 transitions. [2025-03-16 19:28:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:50,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:28:50,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 26941758, now seen corresponding path program 1 times [2025-03-16 19:28:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839677948] [2025-03-16 19:28:50,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,438 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:28:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839677948] [2025-03-16 19:28:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839677948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204729679] [2025-03-16 19:28:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:50,439 INFO L87 Difference]: Start difference. First operand 14634 states and 20554 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:51,104 INFO L93 Difference]: Finished difference Result 32707 states and 45967 transitions. [2025-03-16 19:28:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:51,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:51,126 INFO L225 Difference]: With dead ends: 32707 [2025-03-16 19:28:51,126 INFO L226 Difference]: Without dead ends: 18876 [2025-03-16 19:28:51,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:51,142 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 3591 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:51,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 769 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18876 states. [2025-03-16 19:28:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18876 to 18816. [2025-03-16 19:28:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18816 states, 18812 states have (on average 1.3933659366361897) internal successors, (26212), 18815 states have internal predecessors, (26212), 0 states have call successors, (0), 0 states 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:28:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18816 states to 18816 states and 26212 transitions. [2025-03-16 19:28:51,425 INFO L78 Accepts]: Start accepts. Automaton has 18816 states and 26212 transitions. Word has length 78 [2025-03-16 19:28:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:51,426 INFO L471 AbstractCegarLoop]: Abstraction has 18816 states and 26212 transitions. [2025-03-16 19:28:51,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 18816 states and 26212 transitions. [2025-03-16 19:28:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:51,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:51,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:28:51,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:51,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash -894158130, now seen corresponding path program 1 times [2025-03-16 19:28:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055918887] [2025-03-16 19:28:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:51,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:51,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:51,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:51,579 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:28:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055918887] [2025-03-16 19:28:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055918887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:51,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:51,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639529712] [2025-03-16 19:28:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:51,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:51,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:51,581 INFO L87 Difference]: Start difference. First operand 18816 states and 26212 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:52,449 INFO L93 Difference]: Finished difference Result 38742 states and 54533 transitions. [2025-03-16 19:28:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:28:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:52,482 INFO L225 Difference]: With dead ends: 38742 [2025-03-16 19:28:52,482 INFO L226 Difference]: Without dead ends: 29600 [2025-03-16 19:28:52,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:52,496 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 4574 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:52,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 1592 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29600 states. [2025-03-16 19:28:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29600 to 18900. [2025-03-16 19:28:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18900 states, 18896 states have (on average 1.392887383573243) internal successors, (26320), 18899 states have internal predecessors, (26320), 0 states have call successors, (0), 0 states 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:28:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18900 states to 18900 states and 26320 transitions. [2025-03-16 19:28:52,763 INFO L78 Accepts]: Start accepts. Automaton has 18900 states and 26320 transitions. Word has length 79 [2025-03-16 19:28:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:52,764 INFO L471 AbstractCegarLoop]: Abstraction has 18900 states and 26320 transitions. [2025-03-16 19:28:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18900 states and 26320 transitions. [2025-03-16 19:28:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:52,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:52,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:52,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:28:52,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:52,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -753885975, now seen corresponding path program 1 times [2025-03-16 19:28:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857048877] [2025-03-16 19:28:52,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:52,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:52,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:52,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:52,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:52,879 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:28:52,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:52,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857048877] [2025-03-16 19:28:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857048877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679228100] [2025-03-16 19:28:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:52,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:52,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:52,880 INFO L87 Difference]: Start difference. First operand 18900 states and 26320 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:53,749 INFO L93 Difference]: Finished difference Result 42059 states and 59371 transitions. [2025-03-16 19:28:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:53,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:28:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:53,787 INFO L225 Difference]: With dead ends: 42059 [2025-03-16 19:28:53,788 INFO L226 Difference]: Without dead ends: 34585 [2025-03-16 19:28:53,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:53,802 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 4771 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4771 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:53,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4771 Valid, 1672 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34585 states. [2025-03-16 19:28:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34585 to 19407. [2025-03-16 19:28:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19403 states have (on average 1.391846621656445) internal successors, (27006), 19406 states have internal predecessors, (27006), 0 states have call successors, (0), 0 states 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:28:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 27006 transitions. [2025-03-16 19:28:54,126 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 27006 transitions. Word has length 79 [2025-03-16 19:28:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:54,127 INFO L471 AbstractCegarLoop]: Abstraction has 19407 states and 27006 transitions. [2025-03-16 19:28:54,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 27006 transitions. [2025-03-16 19:28:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:54,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:54,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] [2025-03-16 19:28:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:28:54,135 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1595638952, now seen corresponding path program 1 times [2025-03-16 19:28:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672135192] [2025-03-16 19:28:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:54,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:54,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:54,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:54,357 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:28:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672135192] [2025-03-16 19:28:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672135192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167935634] [2025-03-16 19:28:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:54,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:54,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:54,358 INFO L87 Difference]: Start difference. First operand 19407 states and 27006 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:28:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:54,398 INFO L93 Difference]: Finished difference Result 19407 states and 27006 transitions. [2025-03-16 19:28:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 19:28:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:54,416 INFO L225 Difference]: With dead ends: 19407 [2025-03-16 19:28:54,416 INFO L226 Difference]: Without dead ends: 19405 [2025-03-16 19:28:54,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:28:54,422 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 0 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:54,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3359 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2025-03-16 19:28:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 19405. [2025-03-16 19:28:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19402 states have (on average 1.3890835996289042) internal successors, (26951), 19404 states have internal predecessors, (26951), 0 states have call successors, (0), 0 states 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:28:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 26951 transitions. [2025-03-16 19:28:54,606 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 26951 transitions. Word has length 80 [2025-03-16 19:28:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:54,607 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 26951 transitions. [2025-03-16 19:28:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:28:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 26951 transitions. [2025-03-16 19:28:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:54,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:54,615 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] [2025-03-16 19:28:54,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:28:54,616 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1238435427, now seen corresponding path program 1 times [2025-03-16 19:28:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:54,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711072197] [2025-03-16 19:28:54,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:54,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:54,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:54,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:54,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:54,785 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:28:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711072197] [2025-03-16 19:28:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711072197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100057695] [2025-03-16 19:28:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:54,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:54,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:54,787 INFO L87 Difference]: Start difference. First operand 19405 states and 26951 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:28:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:54,834 INFO L93 Difference]: Finished difference Result 19405 states and 26951 transitions. [2025-03-16 19:28:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 19:28:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:54,855 INFO L225 Difference]: With dead ends: 19405 [2025-03-16 19:28:54,855 INFO L226 Difference]: Without dead ends: 19403 [2025-03-16 19:28:54,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:28:54,862 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 0 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:54,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3353 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19403 states. [2025-03-16 19:28:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19403 to 19403. [2025-03-16 19:28:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19403 states, 19401 states have (on average 1.386320292768414) internal successors, (26896), 19402 states have internal predecessors, (26896), 0 states have call successors, (0), 0 states 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:28:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19403 states to 19403 states and 26896 transitions. [2025-03-16 19:28:55,062 INFO L78 Accepts]: Start accepts. Automaton has 19403 states and 26896 transitions. Word has length 80 [2025-03-16 19:28:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:55,063 INFO L471 AbstractCegarLoop]: Abstraction has 19403 states and 26896 transitions. [2025-03-16 19:28:55,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:28:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19403 states and 26896 transitions. [2025-03-16 19:28:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:55,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:55,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:55,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:28:55,072 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:55,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -843146189, now seen corresponding path program 1 times [2025-03-16 19:28:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:55,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635169907] [2025-03-16 19:28:55,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:55,267 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:28:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635169907] [2025-03-16 19:28:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635169907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226455229] [2025-03-16 19:28:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:55,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:55,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:55,269 INFO L87 Difference]: Start difference. First operand 19403 states and 26896 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:55,312 INFO L93 Difference]: Finished difference Result 19403 states and 26896 transitions. [2025-03-16 19:28:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:28:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:55,334 INFO L225 Difference]: With dead ends: 19403 [2025-03-16 19:28:55,334 INFO L226 Difference]: Without dead ends: 19401 [2025-03-16 19:28:55,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:28:55,342 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 0 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:55,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3347 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19401 states. [2025-03-16 19:28:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19401 to 19401. [2025-03-16 19:28:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19401 states, 19400 states have (on average 1.3821649484536083) internal successors, (26814), 19400 states have internal predecessors, (26814), 0 states have call successors, (0), 0 states 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:28:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 26814 transitions. [2025-03-16 19:28:55,533 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 26814 transitions. Word has length 82 [2025-03-16 19:28:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 19401 states and 26814 transitions. [2025-03-16 19:28:55,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 26814 transitions. [2025-03-16 19:28:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:55,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:28:55,543 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1808923023, now seen corresponding path program 1 times [2025-03-16 19:28:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681044698] [2025-03-16 19:28:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:55,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:55,742 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:28:55,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:55,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681044698] [2025-03-16 19:28:55,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681044698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:55,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:55,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746101684] [2025-03-16 19:28:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:55,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:55,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:55,743 INFO L87 Difference]: Start difference. First operand 19401 states and 26814 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:56,676 INFO L93 Difference]: Finished difference Result 39300 states and 55300 transitions. [2025-03-16 19:28:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:28:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:28:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:56,705 INFO L225 Difference]: With dead ends: 39300 [2025-03-16 19:28:56,706 INFO L226 Difference]: Without dead ends: 28444 [2025-03-16 19:28:56,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:28:56,721 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 3604 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3604 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:56,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3604 Valid, 2807 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28444 states. [2025-03-16 19:28:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28444 to 19401. [2025-03-16 19:28:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19401 states, 19400 states have (on average 1.3815463917525774) internal successors, (26802), 19400 states have internal predecessors, (26802), 0 states have call successors, (0), 0 states 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:28:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 26802 transitions. [2025-03-16 19:28:57,071 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 26802 transitions. Word has length 82 [2025-03-16 19:28:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 19401 states and 26802 transitions. [2025-03-16 19:28:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 26802 transitions. [2025-03-16 19:28:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:57,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:57,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:57,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:28:57,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:57,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 718644019, now seen corresponding path program 1 times [2025-03-16 19:28:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:57,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468973322] [2025-03-16 19:28:57,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:57,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:57,346 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:28:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468973322] [2025-03-16 19:28:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468973322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630323015] [2025-03-16 19:28:57,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:57,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:57,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:57,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:57,347 INFO L87 Difference]: Start difference. First operand 19401 states and 26802 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:58,355 INFO L93 Difference]: Finished difference Result 39953 states and 56227 transitions. [2025-03-16 19:28:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:28:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:28:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:58,386 INFO L225 Difference]: With dead ends: 39953 [2025-03-16 19:28:58,386 INFO L226 Difference]: Without dead ends: 29029 [2025-03-16 19:28:58,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:28:58,402 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 2518 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:58,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 2913 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29029 states. [2025-03-16 19:28:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29029 to 19367. [2025-03-16 19:28:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19367 states, 19366 states have (on average 1.381286791283693) internal successors, (26750), 19366 states have internal predecessors, (26750), 0 states have call successors, (0), 0 states 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:28:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19367 states to 19367 states and 26750 transitions. [2025-03-16 19:28:58,713 INFO L78 Accepts]: Start accepts. Automaton has 19367 states and 26750 transitions. Word has length 83 [2025-03-16 19:28:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 19367 states and 26750 transitions. [2025-03-16 19:28:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 19367 states and 26750 transitions. [2025-03-16 19:28:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:58,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:58,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:58,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:28:58,723 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:58,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:58,723 INFO L85 PathProgramCache]: Analyzing trace with hash -403648153, now seen corresponding path program 1 times [2025-03-16 19:28:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126676222] [2025-03-16 19:28:58,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:58,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:58,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:58,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:58,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:58,817 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:28:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126676222] [2025-03-16 19:28:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126676222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146955386] [2025-03-16 19:28:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:58,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:58,818 INFO L87 Difference]: Start difference. First operand 19367 states and 26750 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:59,519 INFO L93 Difference]: Finished difference Result 45283 states and 63919 transitions. [2025-03-16 19:28:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:28:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:59,563 INFO L225 Difference]: With dead ends: 45283 [2025-03-16 19:28:59,563 INFO L226 Difference]: Without dead ends: 37935 [2025-03-16 19:28:59,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:59,581 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 4791 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4791 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:59,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4791 Valid, 1680 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37935 states. [2025-03-16 19:28:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37935 to 19427. [2025-03-16 19:28:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19427 states, 19426 states have (on average 1.3811386801194276) internal successors, (26830), 19426 states have internal predecessors, (26830), 0 states have call successors, (0), 0 states 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:28:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19427 states to 19427 states and 26830 transitions. [2025-03-16 19:28:59,934 INFO L78 Accepts]: Start accepts. Automaton has 19427 states and 26830 transitions. Word has length 83 [2025-03-16 19:28:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 19427 states and 26830 transitions. [2025-03-16 19:28:59,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19427 states and 26830 transitions. [2025-03-16 19:28:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:59,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:59,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:59,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:28:59,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -426820761, now seen corresponding path program 1 times [2025-03-16 19:28:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294412232] [2025-03-16 19:28:59,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:59,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:59,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:00,065 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:29:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294412232] [2025-03-16 19:29:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294412232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354954663] [2025-03-16 19:29:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:00,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:00,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:00,067 INFO L87 Difference]: Start difference. First operand 19427 states and 26830 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:00,768 INFO L93 Difference]: Finished difference Result 41853 states and 58882 transitions. [2025-03-16 19:29:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:29:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:00,804 INFO L225 Difference]: With dead ends: 41853 [2025-03-16 19:29:00,804 INFO L226 Difference]: Without dead ends: 34597 [2025-03-16 19:29:00,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:00,819 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 4732 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4732 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:00,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4732 Valid, 1660 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34597 states. [2025-03-16 19:29:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34597 to 19517. [2025-03-16 19:29:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19517 states, 19516 states have (on average 1.3809182209469153) internal successors, (26950), 19516 states have internal predecessors, (26950), 0 states have call successors, (0), 0 states 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:29:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19517 states to 19517 states and 26950 transitions. [2025-03-16 19:29:01,102 INFO L78 Accepts]: Start accepts. Automaton has 19517 states and 26950 transitions. Word has length 83 [2025-03-16 19:29:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:01,103 INFO L471 AbstractCegarLoop]: Abstraction has 19517 states and 26950 transitions. [2025-03-16 19:29:01,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19517 states and 26950 transitions. [2025-03-16 19:29:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:29:01,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:01,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:01,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:29:01,112 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1312245346, now seen corresponding path program 1 times [2025-03-16 19:29:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575148725] [2025-03-16 19:29:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:01,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:29:01,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:29:01,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:01,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:01,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575148725] [2025-03-16 19:29:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575148725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:01,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:01,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141383618] [2025-03-16 19:29:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:01,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:01,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:01,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:01,579 INFO L87 Difference]: Start difference. First operand 19517 states and 26950 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:02,321 INFO L93 Difference]: Finished difference Result 43303 states and 61187 transitions. [2025-03-16 19:29:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:29:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:02,355 INFO L225 Difference]: With dead ends: 43303 [2025-03-16 19:29:02,356 INFO L226 Difference]: Without dead ends: 32393 [2025-03-16 19:29:02,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:02,372 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 5498 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5498 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:02,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5498 Valid, 4824 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32393 states. [2025-03-16 19:29:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32393 to 19463. [2025-03-16 19:29:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19463 states, 19462 states have (on average 1.3804336656047682) internal successors, (26866), 19462 states have internal predecessors, (26866), 0 states have call successors, (0), 0 states 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:29:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19463 states to 19463 states and 26866 transitions. [2025-03-16 19:29:02,683 INFO L78 Accepts]: Start accepts. Automaton has 19463 states and 26866 transitions. Word has length 83 [2025-03-16 19:29:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:02,683 INFO L471 AbstractCegarLoop]: Abstraction has 19463 states and 26866 transitions. [2025-03-16 19:29:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19463 states and 26866 transitions. [2025-03-16 19:29:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:29:02,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:02,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:02,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:29:02,693 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:02,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash 203677173, now seen corresponding path program 1 times [2025-03-16 19:29:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312074902] [2025-03-16 19:29:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:02,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:29:02,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:29:02,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:02,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:02,953 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:29:02,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:02,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312074902] [2025-03-16 19:29:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312074902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:02,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14103434] [2025-03-16 19:29:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:02,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:02,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:02,954 INFO L87 Difference]: Start difference. First operand 19463 states and 26866 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:04,251 INFO L93 Difference]: Finished difference Result 31689 states and 44028 transitions. [2025-03-16 19:29:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:29:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:29:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:04,279 INFO L225 Difference]: With dead ends: 31689 [2025-03-16 19:29:04,279 INFO L226 Difference]: Without dead ends: 27880 [2025-03-16 19:29:04,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:29:04,290 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3218 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3218 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:04,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3218 Valid, 3365 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:29:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27880 states. [2025-03-16 19:29:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27880 to 19467. [2025-03-16 19:29:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19467 states, 19466 states have (on average 1.3803041200041097) internal successors, (26869), 19466 states have internal predecessors, (26869), 0 states have call successors, (0), 0 states 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:29:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19467 states to 19467 states and 26869 transitions. [2025-03-16 19:29:04,533 INFO L78 Accepts]: Start accepts. Automaton has 19467 states and 26869 transitions. Word has length 83 [2025-03-16 19:29:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:04,533 INFO L471 AbstractCegarLoop]: Abstraction has 19467 states and 26869 transitions. [2025-03-16 19:29:04,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19467 states and 26869 transitions. [2025-03-16 19:29:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:04,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:04,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:29:04,543 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1372736512, now seen corresponding path program 1 times [2025-03-16 19:29:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967703509] [2025-03-16 19:29:04,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:04,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:04,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:04,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:05,085 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:29:05,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967703509] [2025-03-16 19:29:05,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967703509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:05,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:05,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:29:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463943874] [2025-03-16 19:29:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:05,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:29:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:05,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:29:05,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:29:05,087 INFO L87 Difference]: Start difference. First operand 19467 states and 26869 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:05,994 INFO L93 Difference]: Finished difference Result 69456 states and 98534 transitions. [2025-03-16 19:29:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:29:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:29:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:06,053 INFO L225 Difference]: With dead ends: 69456 [2025-03-16 19:29:06,054 INFO L226 Difference]: Without dead ends: 57690 [2025-03-16 19:29:06,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:29:06,077 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 6761 mSDsluCounter, 6635 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6761 SdHoareTripleChecker+Valid, 7591 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:06,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6761 Valid, 7591 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57690 states. [2025-03-16 19:29:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57690 to 18545. [2025-03-16 19:29:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18545 states, 18544 states have (on average 1.3827113891285592) internal successors, (25641), 18544 states have internal predecessors, (25641), 0 states have call successors, (0), 0 states 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:29:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18545 states to 18545 states and 25641 transitions. [2025-03-16 19:29:06,460 INFO L78 Accepts]: Start accepts. Automaton has 18545 states and 25641 transitions. Word has length 84 [2025-03-16 19:29:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:06,460 INFO L471 AbstractCegarLoop]: Abstraction has 18545 states and 25641 transitions. [2025-03-16 19:29:06,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18545 states and 25641 transitions. [2025-03-16 19:29:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:06,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:06,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:29:06,469 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:06,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1140720529, now seen corresponding path program 1 times [2025-03-16 19:29:06,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450533919] [2025-03-16 19:29:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:06,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:06,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:06,565 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:29:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450533919] [2025-03-16 19:29:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450533919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957794367] [2025-03-16 19:29:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:06,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:06,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:06,566 INFO L87 Difference]: Start difference. First operand 18545 states and 25641 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:07,380 INFO L93 Difference]: Finished difference Result 40847 states and 57557 transitions. [2025-03-16 19:29:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:29:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:07,417 INFO L225 Difference]: With dead ends: 40847 [2025-03-16 19:29:07,417 INFO L226 Difference]: Without dead ends: 33555 [2025-03-16 19:29:07,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:07,432 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 4320 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4320 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:07,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4320 Valid, 1564 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33555 states. [2025-03-16 19:29:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33555 to 18740. [2025-03-16 19:29:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18740 states, 18739 states have (on average 1.3824643791024067) internal successors, (25906), 18739 states have internal predecessors, (25906), 0 states have call successors, (0), 0 states 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:29:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18740 states to 18740 states and 25906 transitions. [2025-03-16 19:29:07,802 INFO L78 Accepts]: Start accepts. Automaton has 18740 states and 25906 transitions. Word has length 84 [2025-03-16 19:29:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 18740 states and 25906 transitions. [2025-03-16 19:29:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18740 states and 25906 transitions. [2025-03-16 19:29:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:07,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:07,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:07,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:29:07,814 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -147226188, now seen corresponding path program 1 times [2025-03-16 19:29:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694504648] [2025-03-16 19:29:07,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:07,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:08,052 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:29:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694504648] [2025-03-16 19:29:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694504648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474765769] [2025-03-16 19:29:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:08,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:08,055 INFO L87 Difference]: Start difference. First operand 18740 states and 25906 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,080 INFO L93 Difference]: Finished difference Result 32908 states and 45913 transitions. [2025-03-16 19:29:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:09,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:29:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,112 INFO L225 Difference]: With dead ends: 32908 [2025-03-16 19:29:09,112 INFO L226 Difference]: Without dead ends: 27031 [2025-03-16 19:29:09,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:09,125 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3381 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 2901 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:29:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2025-03-16 19:29:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 18736. [2025-03-16 19:29:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18736 states, 18735 states have (on average 1.3823325326928209) internal successors, (25898), 18735 states have internal predecessors, (25898), 0 states have call successors, (0), 0 states 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:29:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18736 states to 18736 states and 25898 transitions. [2025-03-16 19:29:09,411 INFO L78 Accepts]: Start accepts. Automaton has 18736 states and 25898 transitions. Word has length 84 [2025-03-16 19:29:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,411 INFO L471 AbstractCegarLoop]: Abstraction has 18736 states and 25898 transitions. [2025-03-16 19:29:09,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18736 states and 25898 transitions. [2025-03-16 19:29:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:09,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:09,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:29:09,419 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1507476432, now seen corresponding path program 1 times [2025-03-16 19:29:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256095782] [2025-03-16 19:29:09,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:09,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:09,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,794 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:29:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256095782] [2025-03-16 19:29:09,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256095782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:29:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160005307] [2025-03-16 19:29:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:29:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:29:09,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:09,795 INFO L87 Difference]: Start difference. First operand 18736 states and 25898 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:11,201 INFO L93 Difference]: Finished difference Result 60826 states and 86357 transitions. [2025-03-16 19:29:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:29:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:29:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:11,256 INFO L225 Difference]: With dead ends: 60826 [2025-03-16 19:29:11,256 INFO L226 Difference]: Without dead ends: 49952 [2025-03-16 19:29:11,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:29:11,277 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 6589 mSDsluCounter, 5298 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6589 SdHoareTripleChecker+Valid, 6131 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:11,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6589 Valid, 6131 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:29:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49952 states. [2025-03-16 19:29:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49952 to 18718. [2025-03-16 19:29:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18718 states, 18717 states have (on average 1.3817385264732596) internal successors, (25862), 18717 states have internal predecessors, (25862), 0 states have call successors, (0), 0 states 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:29:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18718 states to 18718 states and 25862 transitions. [2025-03-16 19:29:11,707 INFO L78 Accepts]: Start accepts. Automaton has 18718 states and 25862 transitions. Word has length 84 [2025-03-16 19:29:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:11,707 INFO L471 AbstractCegarLoop]: Abstraction has 18718 states and 25862 transitions. [2025-03-16 19:29:11,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18718 states and 25862 transitions. [2025-03-16 19:29:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:29:11,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:11,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:29:11,717 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:11,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 581682452, now seen corresponding path program 1 times [2025-03-16 19:29:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205785403] [2025-03-16 19:29:11,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:11,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:29:11,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:29:11,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:11,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:11,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:11,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205785403] [2025-03-16 19:29:11,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205785403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:11,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775235251] [2025-03-16 19:29:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:11,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:11,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:11,903 INFO L87 Difference]: Start difference. First operand 18718 states and 25862 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:12,718 INFO L93 Difference]: Finished difference Result 39316 states and 55385 transitions. [2025-03-16 19:29:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:29:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:29:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:12,748 INFO L225 Difference]: With dead ends: 39316 [2025-03-16 19:29:12,749 INFO L226 Difference]: Without dead ends: 28294 [2025-03-16 19:29:12,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:12,764 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 3323 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3323 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:12,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3323 Valid, 2842 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28294 states. [2025-03-16 19:29:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 18635. [2025-03-16 19:29:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18635 states, 18634 states have (on average 1.3813995921433937) internal successors, (25741), 18634 states have internal predecessors, (25741), 0 states have call successors, (0), 0 states 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:29:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18635 states to 18635 states and 25741 transitions. [2025-03-16 19:29:12,998 INFO L78 Accepts]: Start accepts. Automaton has 18635 states and 25741 transitions. Word has length 85 [2025-03-16 19:29:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 18635 states and 25741 transitions. [2025-03-16 19:29:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 18635 states and 25741 transitions. [2025-03-16 19:29:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:29:13,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:13,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:29:13,008 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash -928441145, now seen corresponding path program 1 times [2025-03-16 19:29:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980535581] [2025-03-16 19:29:13,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:13,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:29:13,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:29:13,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:13,093 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:29:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980535581] [2025-03-16 19:29:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980535581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:13,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795541033] [2025-03-16 19:29:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:13,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:13,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:13,094 INFO L87 Difference]: Start difference. First operand 18635 states and 25741 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:13,721 INFO L93 Difference]: Finished difference Result 48463 states and 68582 transitions. [2025-03-16 19:29:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:29:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:13,761 INFO L225 Difference]: With dead ends: 48463 [2025-03-16 19:29:13,762 INFO L226 Difference]: Without dead ends: 40861 [2025-03-16 19:29:13,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:13,777 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 4466 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:13,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4466 Valid, 1593 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40861 states. [2025-03-16 19:29:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40861 to 18710. [2025-03-16 19:29:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18710 states, 18709 states have (on average 1.3812069057672778) internal successors, (25841), 18709 states have internal predecessors, (25841), 0 states have call successors, (0), 0 states 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:29:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18710 states to 18710 states and 25841 transitions. [2025-03-16 19:29:14,096 INFO L78 Accepts]: Start accepts. Automaton has 18710 states and 25841 transitions. Word has length 85 [2025-03-16 19:29:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:14,096 INFO L471 AbstractCegarLoop]: Abstraction has 18710 states and 25841 transitions. [2025-03-16 19:29:14,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 18710 states and 25841 transitions. [2025-03-16 19:29:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:29:14,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:14,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:14,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:29:14,106 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:14,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1440359219, now seen corresponding path program 1 times [2025-03-16 19:29:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206530925] [2025-03-16 19:29:14,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:14,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:29:14,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:29:14,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:14,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:14,338 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:29:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206530925] [2025-03-16 19:29:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206530925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297075049] [2025-03-16 19:29:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:14,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:14,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:14,342 INFO L87 Difference]: Start difference. First operand 18710 states and 25841 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:15,271 INFO L93 Difference]: Finished difference Result 44884 states and 63165 transitions. [2025-03-16 19:29:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:29:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:15,308 INFO L225 Difference]: With dead ends: 44884 [2025-03-16 19:29:15,308 INFO L226 Difference]: Without dead ends: 32980 [2025-03-16 19:29:15,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:29:15,325 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 3784 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3784 Valid, 3092 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32980 states. [2025-03-16 19:29:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32980 to 18171. [2025-03-16 19:29:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18171 states, 18170 states have (on average 1.3817831590533847) internal successors, (25107), 18170 states have internal predecessors, (25107), 0 states have call successors, (0), 0 states 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:29:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18171 states to 18171 states and 25107 transitions. [2025-03-16 19:29:15,595 INFO L78 Accepts]: Start accepts. Automaton has 18171 states and 25107 transitions. Word has length 85 [2025-03-16 19:29:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:15,595 INFO L471 AbstractCegarLoop]: Abstraction has 18171 states and 25107 transitions. [2025-03-16 19:29:15,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18171 states and 25107 transitions. [2025-03-16 19:29:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:29:15,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:15,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:15,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:29:15,604 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:15,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1512231222, now seen corresponding path program 1 times [2025-03-16 19:29:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:15,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126802355] [2025-03-16 19:29:15,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:15,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:29:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:29:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:15,753 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:29:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:15,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126802355] [2025-03-16 19:29:15,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126802355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:15,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:15,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277145854] [2025-03-16 19:29:15,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:15,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:15,754 INFO L87 Difference]: Start difference. First operand 18171 states and 25107 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:16,463 INFO L93 Difference]: Finished difference Result 38448 states and 54166 transitions. [2025-03-16 19:29:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:29:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:16,492 INFO L225 Difference]: With dead ends: 38448 [2025-03-16 19:29:16,492 INFO L226 Difference]: Without dead ends: 27268 [2025-03-16 19:29:16,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:29:16,505 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2544 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:16,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2544 Valid, 2562 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27268 states. [2025-03-16 19:29:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27268 to 17991. [2025-03-16 19:29:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17991 states, 17990 states have (on average 1.3816008893829905) internal successors, (24855), 17990 states have internal predecessors, (24855), 0 states have call successors, (0), 0 states 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:29:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17991 states to 17991 states and 24855 transitions. [2025-03-16 19:29:16,734 INFO L78 Accepts]: Start accepts. Automaton has 17991 states and 24855 transitions. Word has length 85 [2025-03-16 19:29:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 17991 states and 24855 transitions. [2025-03-16 19:29:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17991 states and 24855 transitions. [2025-03-16 19:29:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:29:16,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:16,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:16,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:29:16,743 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 229809281, now seen corresponding path program 1 times [2025-03-16 19:29:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389223944] [2025-03-16 19:29:16,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:16,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:29:16,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:29:16,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:16,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:17,150 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:29:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389223944] [2025-03-16 19:29:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389223944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:29:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587570461] [2025-03-16 19:29:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:29:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:17,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:29:17,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:29:17,152 INFO L87 Difference]: Start difference. First operand 17991 states and 24855 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:17,932 INFO L93 Difference]: Finished difference Result 67412 states and 95694 transitions. [2025-03-16 19:29:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:29:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 19:29:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:18,005 INFO L225 Difference]: With dead ends: 67412 [2025-03-16 19:29:18,005 INFO L226 Difference]: Without dead ends: 56300 [2025-03-16 19:29:18,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:29:18,032 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 7227 mSDsluCounter, 6924 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7227 SdHoareTripleChecker+Valid, 7915 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:18,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7227 Valid, 7915 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56300 states. [2025-03-16 19:29:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56300 to 17735. [2025-03-16 19:29:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17734 states have (on average 1.381075899402278) internal successors, (24492), 17734 states have internal predecessors, (24492), 0 states have call successors, (0), 0 states 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:29:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 24492 transitions. [2025-03-16 19:29:18,460 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 24492 transitions. Word has length 86 [2025-03-16 19:29:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:18,460 INFO L471 AbstractCegarLoop]: Abstraction has 17735 states and 24492 transitions. [2025-03-16 19:29:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 24492 transitions. [2025-03-16 19:29:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:29:18,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:18,470 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] [2025-03-16 19:29:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:29:18,470 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 510003327, now seen corresponding path program 1 times [2025-03-16 19:29:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151177665] [2025-03-16 19:29:18,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:18,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:29:18,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:29:18,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:18,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:18,829 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:29:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151177665] [2025-03-16 19:29:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151177665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:18,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420929474] [2025-03-16 19:29:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:18,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:18,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:18,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:18,830 INFO L87 Difference]: Start difference. First operand 17735 states and 24492 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:19,688 INFO L93 Difference]: Finished difference Result 34061 states and 47893 transitions. [2025-03-16 19:29:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 19:29:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:19,720 INFO L225 Difference]: With dead ends: 34061 [2025-03-16 19:29:19,720 INFO L226 Difference]: Without dead ends: 29202 [2025-03-16 19:29:19,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:19,731 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 4334 mSDsluCounter, 3986 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 4746 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:19,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 4746 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29202 states. [2025-03-16 19:29:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29202 to 17742. [2025-03-16 19:29:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17742 states, 17741 states have (on average 1.3810946395355392) internal successors, (24502), 17741 states have internal predecessors, (24502), 0 states have call successors, (0), 0 states 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:29:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17742 states to 17742 states and 24502 transitions. [2025-03-16 19:29:19,935 INFO L78 Accepts]: Start accepts. Automaton has 17742 states and 24502 transitions. Word has length 86 [2025-03-16 19:29:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 17742 states and 24502 transitions. [2025-03-16 19:29:19,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17742 states and 24502 transitions. [2025-03-16 19:29:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:29:19,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:19,944 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] [2025-03-16 19:29:19,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:29:19,944 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1980734518, now seen corresponding path program 1 times [2025-03-16 19:29:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494028944] [2025-03-16 19:29:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:19,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:29:19,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:29:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:19,988 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:29:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494028944] [2025-03-16 19:29:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494028944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889729443] [2025-03-16 19:29:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:19,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:19,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:19,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:19,990 INFO L87 Difference]: Start difference. First operand 17742 states and 24502 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:20,059 INFO L93 Difference]: Finished difference Result 25718 states and 35876 transitions. [2025-03-16 19:29:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 19:29:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:20,075 INFO L225 Difference]: With dead ends: 25718 [2025-03-16 19:29:20,075 INFO L226 Difference]: Without dead ends: 17744 [2025-03-16 19:29:20,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:29:20,086 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 456 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:20,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1897 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17744 states. [2025-03-16 19:29:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17744 to 17742. [2025-03-16 19:29:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17742 states, 17741 states have (on average 1.3700467842849895) internal successors, (24306), 17741 states have internal predecessors, (24306), 0 states have call successors, (0), 0 states 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:29:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17742 states to 17742 states and 24306 transitions. [2025-03-16 19:29:20,288 INFO L78 Accepts]: Start accepts. Automaton has 17742 states and 24306 transitions. Word has length 86 [2025-03-16 19:29:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 17742 states and 24306 transitions. [2025-03-16 19:29:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:29:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17742 states and 24306 transitions. [2025-03-16 19:29:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:20,297 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] [2025-03-16 19:29:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:29:20,298 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash -429226468, now seen corresponding path program 1 times [2025-03-16 19:29:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428159048] [2025-03-16 19:29:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:20,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:20,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:20,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428159048] [2025-03-16 19:29:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428159048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226525389] [2025-03-16 19:29:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:20,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:20,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:20,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:20,366 INFO L87 Difference]: Start difference. First operand 17742 states and 24306 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:20,425 INFO L93 Difference]: Finished difference Result 26583 states and 36747 transitions. [2025-03-16 19:29:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:29:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:20,439 INFO L225 Difference]: With dead ends: 26583 [2025-03-16 19:29:20,440 INFO L226 Difference]: Without dead ends: 17744 [2025-03-16 19:29:20,448 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:29:20,449 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 580 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:20,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 2148 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17744 states. [2025-03-16 19:29:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17744 to 17742. [2025-03-16 19:29:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17742 states, 17741 states have (on average 1.3613663265881293) internal successors, (24152), 17741 states have internal predecessors, (24152), 0 states have call successors, (0), 0 states 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:29:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17742 states to 17742 states and 24152 transitions. [2025-03-16 19:29:20,606 INFO L78 Accepts]: Start accepts. Automaton has 17742 states and 24152 transitions. Word has length 87 [2025-03-16 19:29:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:20,606 INFO L471 AbstractCegarLoop]: Abstraction has 17742 states and 24152 transitions. [2025-03-16 19:29:20,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17742 states and 24152 transitions. [2025-03-16 19:29:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:20,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:20,615 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] [2025-03-16 19:29:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:29:20,615 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -370365861, now seen corresponding path program 1 times [2025-03-16 19:29:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831559211] [2025-03-16 19:29:20,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:20,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:20,792 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:29:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831559211] [2025-03-16 19:29:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831559211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:20,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321407928] [2025-03-16 19:29:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:20,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:20,795 INFO L87 Difference]: Start difference. First operand 17742 states and 24152 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:21,562 INFO L93 Difference]: Finished difference Result 37992 states and 52793 transitions. [2025-03-16 19:29:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:29:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:21,591 INFO L225 Difference]: With dead ends: 37992 [2025-03-16 19:29:21,591 INFO L226 Difference]: Without dead ends: 26812 [2025-03-16 19:29:21,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:21,605 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 3111 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:21,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3111 Valid, 2557 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26812 states. [2025-03-16 19:29:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26812 to 17869. [2025-03-16 19:29:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17869 states, 17868 states have (on average 1.359637340496978) internal successors, (24294), 17868 states have internal predecessors, (24294), 0 states have call successors, (0), 0 states 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:29:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17869 states to 17869 states and 24294 transitions. [2025-03-16 19:29:21,824 INFO L78 Accepts]: Start accepts. Automaton has 17869 states and 24294 transitions. Word has length 87 [2025-03-16 19:29:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 17869 states and 24294 transitions. [2025-03-16 19:29:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17869 states and 24294 transitions. [2025-03-16 19:29:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:21,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:21,832 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] [2025-03-16 19:29:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:29:21,833 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 377545308, now seen corresponding path program 1 times [2025-03-16 19:29:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194923163] [2025-03-16 19:29:21,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:21,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:21,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:21,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:21,993 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:29:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194923163] [2025-03-16 19:29:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194923163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624998358] [2025-03-16 19:29:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:21,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:21,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:21,994 INFO L87 Difference]: Start difference. First operand 17869 states and 24294 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:22,770 INFO L93 Difference]: Finished difference Result 26407 states and 36212 transitions. [2025-03-16 19:29:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:22,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:29:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:22,796 INFO L225 Difference]: With dead ends: 26407 [2025-03-16 19:29:22,796 INFO L226 Difference]: Without dead ends: 22709 [2025-03-16 19:29:22,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:22,806 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 3413 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3413 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:22,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3413 Valid, 2407 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22709 states. [2025-03-16 19:29:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22709 to 17857. [2025-03-16 19:29:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17857 states, 17856 states have (on average 1.3592069892473118) internal successors, (24270), 17856 states have internal predecessors, (24270), 0 states have call successors, (0), 0 states 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:29:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17857 states to 17857 states and 24270 transitions. [2025-03-16 19:29:23,093 INFO L78 Accepts]: Start accepts. Automaton has 17857 states and 24270 transitions. Word has length 87 [2025-03-16 19:29:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:23,093 INFO L471 AbstractCegarLoop]: Abstraction has 17857 states and 24270 transitions. [2025-03-16 19:29:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17857 states and 24270 transitions. [2025-03-16 19:29:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:23,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:23,102 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] [2025-03-16 19:29:23,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:29:23,102 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1149882540, now seen corresponding path program 1 times [2025-03-16 19:29:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636957252] [2025-03-16 19:29:23,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:23,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:23,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:23,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:23,145 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:29:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636957252] [2025-03-16 19:29:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636957252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:23,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:23,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778188401] [2025-03-16 19:29:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:23,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:23,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:23,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:23,146 INFO L87 Difference]: Start difference. First operand 17857 states and 24270 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:23,243 INFO L93 Difference]: Finished difference Result 30829 states and 42337 transitions. [2025-03-16 19:29:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:29:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:23,263 INFO L225 Difference]: With dead ends: 30829 [2025-03-16 19:29:23,263 INFO L226 Difference]: Without dead ends: 20950 [2025-03-16 19:29:23,274 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:29:23,275 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 713 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:23,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 965 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20950 states. [2025-03-16 19:29:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20950 to 16368. [2025-03-16 19:29:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16368 states, 16367 states have (on average 1.3615812305248365) internal successors, (22285), 16367 states have internal predecessors, (22285), 0 states have call successors, (0), 0 states 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:29:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16368 states to 16368 states and 22285 transitions. [2025-03-16 19:29:23,451 INFO L78 Accepts]: Start accepts. Automaton has 16368 states and 22285 transitions. Word has length 87 [2025-03-16 19:29:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:23,451 INFO L471 AbstractCegarLoop]: Abstraction has 16368 states and 22285 transitions. [2025-03-16 19:29:23,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16368 states and 22285 transitions. [2025-03-16 19:29:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:23,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:23,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:23,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:29:23,460 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:23,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1610166440, now seen corresponding path program 1 times [2025-03-16 19:29:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848936666] [2025-03-16 19:29:23,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:23,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:23,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:23,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:23,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:23,497 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:29:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848936666] [2025-03-16 19:29:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848936666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227637265] [2025-03-16 19:29:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:23,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:23,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:23,498 INFO L87 Difference]: Start difference. First operand 16368 states and 22285 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:23,582 INFO L93 Difference]: Finished difference Result 30412 states and 41696 transitions. [2025-03-16 19:29:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:29:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:23,603 INFO L225 Difference]: With dead ends: 30412 [2025-03-16 19:29:23,603 INFO L226 Difference]: Without dead ends: 20382 [2025-03-16 19:29:23,614 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:29:23,614 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 718 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:23,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20382 states. [2025-03-16 19:29:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20382 to 15267. [2025-03-16 19:29:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15267 states, 15266 states have (on average 1.366042185248264) internal successors, (20854), 15266 states have internal predecessors, (20854), 0 states have call successors, (0), 0 states 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:29:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 20854 transitions. [2025-03-16 19:29:23,780 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 20854 transitions. Word has length 88 [2025-03-16 19:29:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:23,780 INFO L471 AbstractCegarLoop]: Abstraction has 15267 states and 20854 transitions. [2025-03-16 19:29:23,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 20854 transitions. [2025-03-16 19:29:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:23,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:23,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:29:23,788 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash -16524702, now seen corresponding path program 1 times [2025-03-16 19:29:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108726587] [2025-03-16 19:29:23,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:23,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:23,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:23,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:23,829 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:29:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108726587] [2025-03-16 19:29:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108726587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045129258] [2025-03-16 19:29:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:23,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:23,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:23,830 INFO L87 Difference]: Start difference. First operand 15267 states and 20854 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:23,901 INFO L93 Difference]: Finished difference Result 22552 states and 31089 transitions. [2025-03-16 19:29:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:29:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:23,911 INFO L225 Difference]: With dead ends: 22552 [2025-03-16 19:29:23,912 INFO L226 Difference]: Without dead ends: 15269 [2025-03-16 19:29:23,916 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:29:23,917 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 403 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:23,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1582 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15269 states. [2025-03-16 19:29:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15269 to 15267. [2025-03-16 19:29:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15267 states, 15266 states have (on average 1.3522861260317045) internal successors, (20644), 15266 states have internal predecessors, (20644), 0 states have call successors, (0), 0 states 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:29:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 20644 transitions. [2025-03-16 19:29:24,029 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 20644 transitions. Word has length 88 [2025-03-16 19:29:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 15267 states and 20644 transitions. [2025-03-16 19:29:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 20644 transitions. [2025-03-16 19:29:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:24,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:24,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:29:24,036 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash -124988626, now seen corresponding path program 1 times [2025-03-16 19:29:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845560108] [2025-03-16 19:29:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:24,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:24,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:24,075 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:29:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845560108] [2025-03-16 19:29:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845560108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:24,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644282705] [2025-03-16 19:29:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:24,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:24,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:24,076 INFO L87 Difference]: Start difference. First operand 15267 states and 20644 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:24,178 INFO L93 Difference]: Finished difference Result 27312 states and 37345 transitions. [2025-03-16 19:29:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:29:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:24,191 INFO L225 Difference]: With dead ends: 27312 [2025-03-16 19:29:24,191 INFO L226 Difference]: Without dead ends: 18168 [2025-03-16 19:29:24,198 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:29:24,198 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 632 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:24,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 805 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18168 states. [2025-03-16 19:29:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18168 to 14336. [2025-03-16 19:29:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14336 states, 14335 states have (on average 1.35772584583188) internal successors, (19463), 14335 states have internal predecessors, (19463), 0 states have call successors, (0), 0 states 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:29:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14336 states to 14336 states and 19463 transitions. [2025-03-16 19:29:24,314 INFO L78 Accepts]: Start accepts. Automaton has 14336 states and 19463 transitions. Word has length 88 [2025-03-16 19:29:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 14336 states and 19463 transitions. [2025-03-16 19:29:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 14336 states and 19463 transitions. [2025-03-16 19:29:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:24,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:24,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:24,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:29:24,321 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:24,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 162474154, now seen corresponding path program 1 times [2025-03-16 19:29:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117825439] [2025-03-16 19:29:24,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:24,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:24,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:24,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:24,697 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:29:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117825439] [2025-03-16 19:29:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117825439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:24,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:29:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269920754] [2025-03-16 19:29:24,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:29:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:24,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:29:24,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:24,698 INFO L87 Difference]: Start difference. First operand 14336 states and 19463 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:25,572 INFO L93 Difference]: Finished difference Result 37227 states and 51515 transitions. [2025-03-16 19:29:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:29:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:29:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:25,613 INFO L225 Difference]: With dead ends: 37227 [2025-03-16 19:29:25,613 INFO L226 Difference]: Without dead ends: 36803 [2025-03-16 19:29:25,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:29:25,625 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 4635 mSDsluCounter, 3706 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:25,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 4347 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36803 states. [2025-03-16 19:29:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36803 to 14334. [2025-03-16 19:29:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14334 states, 14333 states have (on average 1.357636224098235) internal successors, (19459), 14333 states have internal predecessors, (19459), 0 states have call successors, (0), 0 states 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:29:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14334 states to 14334 states and 19459 transitions. [2025-03-16 19:29:25,844 INFO L78 Accepts]: Start accepts. Automaton has 14334 states and 19459 transitions. Word has length 88 [2025-03-16 19:29:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:25,844 INFO L471 AbstractCegarLoop]: Abstraction has 14334 states and 19459 transitions. [2025-03-16 19:29:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 14334 states and 19459 transitions. [2025-03-16 19:29:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:25,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:25,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:25,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:29:25,852 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1222028260, now seen corresponding path program 1 times [2025-03-16 19:29:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269938620] [2025-03-16 19:29:25,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:25,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:25,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:25,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:25,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:26,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269938620] [2025-03-16 19:29:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269938620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:26,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071860869] [2025-03-16 19:29:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:26,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:26,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:26,026 INFO L87 Difference]: Start difference. First operand 14334 states and 19459 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:26,623 INFO L93 Difference]: Finished difference Result 23217 states and 31858 transitions. [2025-03-16 19:29:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:29:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:26,645 INFO L225 Difference]: With dead ends: 23217 [2025-03-16 19:29:26,645 INFO L226 Difference]: Without dead ends: 21979 [2025-03-16 19:29:26,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:26,652 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2233 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:26,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 2059 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21979 states. [2025-03-16 19:29:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21979 to 14325. [2025-03-16 19:29:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14325 states, 14324 states have (on average 1.357511868193242) internal successors, (19445), 14324 states have internal predecessors, (19445), 0 states have call successors, (0), 0 states 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:29:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14325 states to 14325 states and 19445 transitions. [2025-03-16 19:29:26,831 INFO L78 Accepts]: Start accepts. Automaton has 14325 states and 19445 transitions. Word has length 89 [2025-03-16 19:29:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:26,831 INFO L471 AbstractCegarLoop]: Abstraction has 14325 states and 19445 transitions. [2025-03-16 19:29:26,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 14325 states and 19445 transitions. [2025-03-16 19:29:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:26,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:26,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:29:26,839 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1154349282, now seen corresponding path program 1 times [2025-03-16 19:29:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939869733] [2025-03-16 19:29:26,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:26,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:26,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:26,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:26,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:26,994 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:29:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939869733] [2025-03-16 19:29:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939869733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697699699] [2025-03-16 19:29:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:26,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:26,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:26,996 INFO L87 Difference]: Start difference. First operand 14325 states and 19445 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:27,546 INFO L93 Difference]: Finished difference Result 20547 states and 27917 transitions. [2025-03-16 19:29:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:27,566 INFO L225 Difference]: With dead ends: 20547 [2025-03-16 19:29:27,566 INFO L226 Difference]: Without dead ends: 19226 [2025-03-16 19:29:27,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:27,574 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 2652 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:27,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 1999 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19226 states. [2025-03-16 19:29:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19226 to 14266. [2025-03-16 19:29:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14266 states, 14265 states have (on average 1.3577988082719943) internal successors, (19369), 14265 states have internal predecessors, (19369), 0 states have call successors, (0), 0 states 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:29:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14266 states to 14266 states and 19369 transitions. [2025-03-16 19:29:27,725 INFO L78 Accepts]: Start accepts. Automaton has 14266 states and 19369 transitions. Word has length 89 [2025-03-16 19:29:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:27,725 INFO L471 AbstractCegarLoop]: Abstraction has 14266 states and 19369 transitions. [2025-03-16 19:29:27,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14266 states and 19369 transitions. [2025-03-16 19:29:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:29:27,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:27,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:27,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 19:29:27,733 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:27,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1346532268, now seen corresponding path program 1 times [2025-03-16 19:29:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:27,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228542986] [2025-03-16 19:29:27,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:27,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:29:27,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:29:27,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:27,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:28,047 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:29:28,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228542986] [2025-03-16 19:29:28,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228542986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:28,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:29:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284948209] [2025-03-16 19:29:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:28,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:29:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:28,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:29:28,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:28,049 INFO L87 Difference]: Start difference. First operand 14266 states and 19369 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:28,524 INFO L93 Difference]: Finished difference Result 22156 states and 30441 transitions. [2025-03-16 19:29:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:29:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:28,544 INFO L225 Difference]: With dead ends: 22156 [2025-03-16 19:29:28,545 INFO L226 Difference]: Without dead ends: 21291 [2025-03-16 19:29:28,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:29:28,552 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 3934 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3934 SdHoareTripleChecker+Valid, 3419 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3934 Valid, 3419 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21291 states. [2025-03-16 19:29:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21291 to 14213. [2025-03-16 19:29:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14213 states, 14212 states have (on average 1.358359133126935) internal successors, (19305), 14212 states have internal predecessors, (19305), 0 states have call successors, (0), 0 states 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:29:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14213 states to 14213 states and 19305 transitions. [2025-03-16 19:29:28,706 INFO L78 Accepts]: Start accepts. Automaton has 14213 states and 19305 transitions. Word has length 90 [2025-03-16 19:29:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 14213 states and 19305 transitions. [2025-03-16 19:29:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14213 states and 19305 transitions. [2025-03-16 19:29:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:29:28,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:28,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 19:29:28,714 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1337671095, now seen corresponding path program 1 times [2025-03-16 19:29:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942909967] [2025-03-16 19:29:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:28,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:29:28,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:29:28,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:28,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:29,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:29:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942909967] [2025-03-16 19:29:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942909967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886589804] [2025-03-16 19:29:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:29,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:29,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:29,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:29,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:29,080 INFO L87 Difference]: Start difference. First operand 14213 states and 19305 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:29,626 INFO L93 Difference]: Finished difference Result 21595 states and 29651 transitions. [2025-03-16 19:29:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:29:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:29,646 INFO L225 Difference]: With dead ends: 21595 [2025-03-16 19:29:29,646 INFO L226 Difference]: Without dead ends: 21278 [2025-03-16 19:29:29,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:29,653 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 3876 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3876 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:29,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3876 Valid, 3265 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2025-03-16 19:29:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 14200. [2025-03-16 19:29:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14200 states, 14199 states have (on average 1.3584759490104936) internal successors, (19289), 14199 states have internal predecessors, (19289), 0 states have call successors, (0), 0 states 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:29:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 19289 transitions. [2025-03-16 19:29:29,810 INFO L78 Accepts]: Start accepts. Automaton has 14200 states and 19289 transitions. Word has length 90 [2025-03-16 19:29:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:29,810 INFO L471 AbstractCegarLoop]: Abstraction has 14200 states and 19289 transitions. [2025-03-16 19:29:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14200 states and 19289 transitions. [2025-03-16 19:29:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:29:29,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:29,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:29,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 19:29:29,819 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1168921250, now seen corresponding path program 1 times [2025-03-16 19:29:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436839552] [2025-03-16 19:29:29,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:29,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:29:29,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:29:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:30,140 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:29:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436839552] [2025-03-16 19:29:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436839552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:30,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:30,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628929804] [2025-03-16 19:29:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:30,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:30,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:30,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:30,141 INFO L87 Difference]: Start difference. First operand 14200 states and 19289 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:30,706 INFO L93 Difference]: Finished difference Result 22054 states and 30324 transitions. [2025-03-16 19:29:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:29:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:30,728 INFO L225 Difference]: With dead ends: 22054 [2025-03-16 19:29:30,728 INFO L226 Difference]: Without dead ends: 21156 [2025-03-16 19:29:30,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:30,735 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 2640 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:30,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 4035 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21156 states. [2025-03-16 19:29:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21156 to 14102. [2025-03-16 19:29:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 14101 states have (on average 1.3591234664208212) internal successors, (19165), 14101 states have internal predecessors, (19165), 0 states have call successors, (0), 0 states 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:29:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 19165 transitions. [2025-03-16 19:29:30,885 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 19165 transitions. Word has length 90 [2025-03-16 19:29:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:30,885 INFO L471 AbstractCegarLoop]: Abstraction has 14102 states and 19165 transitions. [2025-03-16 19:29:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 19165 transitions. [2025-03-16 19:29:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:29:30,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:30,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:30,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 19:29:30,893 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -838754217, now seen corresponding path program 1 times [2025-03-16 19:29:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272209861] [2025-03-16 19:29:30,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:30,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:29:30,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:29:30,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:30,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:31,073 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:29:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:31,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272209861] [2025-03-16 19:29:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272209861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377696283] [2025-03-16 19:29:31,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:31,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:31,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:31,075 INFO L87 Difference]: Start difference. First operand 14102 states and 19165 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:31,581 INFO L93 Difference]: Finished difference Result 22120 states and 30291 transitions. [2025-03-16 19:29:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 19:29:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:31,604 INFO L225 Difference]: With dead ends: 22120 [2025-03-16 19:29:31,604 INFO L226 Difference]: Without dead ends: 21696 [2025-03-16 19:29:31,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:31,612 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2151 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:31,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 1892 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2025-03-16 19:29:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 14102. [2025-03-16 19:29:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 14101 states have (on average 1.3590525494645769) internal successors, (19164), 14101 states have internal predecessors, (19164), 0 states have call successors, (0), 0 states 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:29:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 19164 transitions. [2025-03-16 19:29:31,770 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 19164 transitions. Word has length 93 [2025-03-16 19:29:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 14102 states and 19164 transitions. [2025-03-16 19:29:31,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 19164 transitions. [2025-03-16 19:29:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:29:31,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:31,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:31,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 19:29:31,779 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1207949105, now seen corresponding path program 1 times [2025-03-16 19:29:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286525448] [2025-03-16 19:29:31,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:31,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:29:31,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:29:31,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:31,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:31,935 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:29:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286525448] [2025-03-16 19:29:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286525448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:31,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:31,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601230790] [2025-03-16 19:29:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:31,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:31,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:31,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:31,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:31,936 INFO L87 Difference]: Start difference. First operand 14102 states and 19164 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:32,507 INFO L93 Difference]: Finished difference Result 18914 states and 25742 transitions. [2025-03-16 19:29:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 19:29:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:32,524 INFO L225 Difference]: With dead ends: 18914 [2025-03-16 19:29:32,524 INFO L226 Difference]: Without dead ends: 18492 [2025-03-16 19:29:32,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:32,530 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2558 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2558 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:32,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2558 Valid, 1892 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18492 states. [2025-03-16 19:29:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18492 to 14102. [2025-03-16 19:29:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 14101 states have (on average 1.3589816325083328) internal successors, (19163), 14101 states have internal predecessors, (19163), 0 states have call successors, (0), 0 states 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:29:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 19163 transitions. [2025-03-16 19:29:32,668 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 19163 transitions. Word has length 93 [2025-03-16 19:29:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 14102 states and 19163 transitions. [2025-03-16 19:29:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 19163 transitions. [2025-03-16 19:29:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:29:32,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:32,677 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] [2025-03-16 19:29:32,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 19:29:32,678 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:32,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash -736298757, now seen corresponding path program 1 times [2025-03-16 19:29:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600085761] [2025-03-16 19:29:32,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:32,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:29:32,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:29:32,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:32,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:32,722 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:29:32,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600085761] [2025-03-16 19:29:32,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600085761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:32,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:32,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561302839] [2025-03-16 19:29:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:32,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:32,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:32,724 INFO L87 Difference]: Start difference. First operand 14102 states and 19163 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:29:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:32,772 INFO L93 Difference]: Finished difference Result 21588 states and 29577 transitions. [2025-03-16 19:29:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:29:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:32,786 INFO L225 Difference]: With dead ends: 21588 [2025-03-16 19:29:32,786 INFO L226 Difference]: Without dead ends: 14104 [2025-03-16 19:29:32,796 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:29:32,796 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 430 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:32,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1515 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14104 states. [2025-03-16 19:29:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14104 to 14102. [2025-03-16 19:29:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 14101 states have (on average 1.3494787603716047) internal successors, (19029), 14101 states have internal predecessors, (19029), 0 states have call successors, (0), 0 states 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:29:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 19029 transitions. [2025-03-16 19:29:32,925 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 19029 transitions. Word has length 94 [2025-03-16 19:29:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:32,925 INFO L471 AbstractCegarLoop]: Abstraction has 14102 states and 19029 transitions. [2025-03-16 19:29:32,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:29:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 19029 transitions. [2025-03-16 19:29:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:29:32,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:32,935 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] [2025-03-16 19:29:32,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 19:29:32,935 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:32,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1456300595, now seen corresponding path program 1 times [2025-03-16 19:29:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841396206] [2025-03-16 19:29:32,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:29:32,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:29:32,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:32,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841396206] [2025-03-16 19:29:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841396206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:32,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:32,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307904484] [2025-03-16 19:29:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:32,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:32,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:32,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:32,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:32,978 INFO L87 Difference]: Start difference. First operand 14102 states and 19029 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:29:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:33,049 INFO L93 Difference]: Finished difference Result 25564 states and 34875 transitions. [2025-03-16 19:29:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 19:29:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:33,065 INFO L225 Difference]: With dead ends: 25564 [2025-03-16 19:29:33,065 INFO L226 Difference]: Without dead ends: 16914 [2025-03-16 19:29:33,074 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:29:33,075 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 627 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:33,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 901 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16914 states. [2025-03-16 19:29:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16914 to 13136. [2025-03-16 19:29:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13136 states, 13135 states have (on average 1.3533307955843168) internal successors, (17776), 13135 states have internal predecessors, (17776), 0 states have call successors, (0), 0 states 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:29:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13136 states to 13136 states and 17776 transitions. [2025-03-16 19:29:33,198 INFO L78 Accepts]: Start accepts. Automaton has 13136 states and 17776 transitions. Word has length 95 [2025-03-16 19:29:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 13136 states and 17776 transitions. [2025-03-16 19:29:33,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:29:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states and 17776 transitions. [2025-03-16 19:29:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:33,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:33,207 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] [2025-03-16 19:29:33,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 19:29:33,207 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -53237986, now seen corresponding path program 1 times [2025-03-16 19:29:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:33,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146508908] [2025-03-16 19:29:33,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:33,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146508908] [2025-03-16 19:29:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146508908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:33,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:33,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672467894] [2025-03-16 19:29:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:33,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:33,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:33,574 INFO L87 Difference]: Start difference. First operand 13136 states and 17776 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:34,068 INFO L93 Difference]: Finished difference Result 20110 states and 27506 transitions. [2025-03-16 19:29:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:34,088 INFO L225 Difference]: With dead ends: 20110 [2025-03-16 19:29:34,088 INFO L226 Difference]: Without dead ends: 19905 [2025-03-16 19:29:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:34,095 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 3562 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3562 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:34,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3562 Valid, 2974 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19905 states. [2025-03-16 19:29:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19905 to 13075. [2025-03-16 19:29:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13075 states, 13074 states have (on average 1.3536790576717148) internal successors, (17698), 13074 states have internal predecessors, (17698), 0 states have call successors, (0), 0 states 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:29:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 17698 transitions. [2025-03-16 19:29:34,234 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 17698 transitions. Word has length 96 [2025-03-16 19:29:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:34,234 INFO L471 AbstractCegarLoop]: Abstraction has 13075 states and 17698 transitions. [2025-03-16 19:29:34,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 17698 transitions. [2025-03-16 19:29:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:34,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:34,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 19:29:34,244 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 443395625, now seen corresponding path program 1 times [2025-03-16 19:29:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678663649] [2025-03-16 19:29:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:34,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:34,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:34,326 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:29:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678663649] [2025-03-16 19:29:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678663649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561429825] [2025-03-16 19:29:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:34,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:34,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:34,327 INFO L87 Difference]: Start difference. First operand 13075 states and 17698 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:34,491 INFO L93 Difference]: Finished difference Result 46891 states and 65494 transitions. [2025-03-16 19:29:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:34,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:29:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:34,530 INFO L225 Difference]: With dead ends: 46891 [2025-03-16 19:29:34,530 INFO L226 Difference]: Without dead ends: 36899 [2025-03-16 19:29:34,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:29:34,546 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 3533 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3533 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:34,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3533 Valid, 2042 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36899 states. [2025-03-16 19:29:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36899 to 23065. [2025-03-16 19:29:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 23064 states have (on average 1.3655480402358655) internal successors, (31495), 23064 states have internal predecessors, (31495), 0 states have call successors, (0), 0 states 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:29:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 31495 transitions. [2025-03-16 19:29:34,821 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 31495 transitions. Word has length 99 [2025-03-16 19:29:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:34,822 INFO L471 AbstractCegarLoop]: Abstraction has 23065 states and 31495 transitions. [2025-03-16 19:29:34,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 31495 transitions. [2025-03-16 19:29:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:29:34,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:34,837 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] [2025-03-16 19:29:34,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 19:29:34,838 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:34,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash 889946980, now seen corresponding path program 1 times [2025-03-16 19:29:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819352678] [2025-03-16 19:29:34,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:29:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:29:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:34,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:29:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819352678] [2025-03-16 19:29:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819352678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509832755] [2025-03-16 19:29:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:34,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:34,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:34,939 INFO L87 Difference]: Start difference. First operand 23065 states and 31495 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:29:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:35,115 INFO L93 Difference]: Finished difference Result 29595 states and 40403 transitions. [2025-03-16 19:29:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:35,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 19:29:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:35,146 INFO L225 Difference]: With dead ends: 29595 [2025-03-16 19:29:35,146 INFO L226 Difference]: Without dead ends: 27683 [2025-03-16 19:29:35,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:35,157 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 2264 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:35,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 1881 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27683 states. [2025-03-16 19:29:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27683 to 26755. [2025-03-16 19:29:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26755 states, 26754 states have (on average 1.3673469387755102) internal successors, (36582), 26754 states have internal predecessors, (36582), 0 states have call successors, (0), 0 states 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:29:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26755 states to 26755 states and 36582 transitions. [2025-03-16 19:29:35,424 INFO L78 Accepts]: Start accepts. Automaton has 26755 states and 36582 transitions. Word has length 100 [2025-03-16 19:29:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:35,424 INFO L471 AbstractCegarLoop]: Abstraction has 26755 states and 36582 transitions. [2025-03-16 19:29:35,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:29:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 26755 states and 36582 transitions. [2025-03-16 19:29:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:29:35,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:35,442 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] [2025-03-16 19:29:35,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 19:29:35,442 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:35,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -735356091, now seen corresponding path program 1 times [2025-03-16 19:29:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030804693] [2025-03-16 19:29:35,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:35,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:29:35,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:29:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:35,515 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:29:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030804693] [2025-03-16 19:29:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030804693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144558895] [2025-03-16 19:29:35,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:35,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:35,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:35,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:35,516 INFO L87 Difference]: Start difference. First operand 26755 states and 36582 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:29:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:35,656 INFO L93 Difference]: Finished difference Result 71503 states and 98856 transitions. [2025-03-16 19:29:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:35,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 19:29:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:35,710 INFO L225 Difference]: With dead ends: 71503 [2025-03-16 19:29:35,710 INFO L226 Difference]: Without dead ends: 47817 [2025-03-16 19:29:35,736 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:29:35,736 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 219 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:35,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1241 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47817 states. [2025-03-16 19:29:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47817 to 44631. [2025-03-16 19:29:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44631 states, 44630 states have (on average 1.3740533273582791) internal successors, (61324), 44630 states have internal predecessors, (61324), 0 states have call successors, (0), 0 states 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:29:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44631 states to 44631 states and 61324 transitions. [2025-03-16 19:29:36,212 INFO L78 Accepts]: Start accepts. Automaton has 44631 states and 61324 transitions. Word has length 101 [2025-03-16 19:29:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 44631 states and 61324 transitions. [2025-03-16 19:29:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:29:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44631 states and 61324 transitions. [2025-03-16 19:29:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:29:36,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:36,227 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] [2025-03-16 19:29:36,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 19:29:36,227 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:36,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1369928989, now seen corresponding path program 1 times [2025-03-16 19:29:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:36,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880275799] [2025-03-16 19:29:36,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:36,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:29:36,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:29:36,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:36,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:36,297 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:29:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880275799] [2025-03-16 19:29:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880275799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:36,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:36,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267536986] [2025-03-16 19:29:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:36,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:36,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:36,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:36,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:36,298 INFO L87 Difference]: Start difference. First operand 44631 states and 61324 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:29:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:36,533 INFO L93 Difference]: Finished difference Result 124059 states and 171438 transitions. [2025-03-16 19:29:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 19:29:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:36,623 INFO L225 Difference]: With dead ends: 124059 [2025-03-16 19:29:36,623 INFO L226 Difference]: Without dead ends: 82497 [2025-03-16 19:29:36,666 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:29:36,667 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 197 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:36,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1235 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82497 states. [2025-03-16 19:29:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82497 to 76527. [2025-03-16 19:29:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76527 states, 76526 states have (on average 1.3753234194914148) internal successors, (105248), 76526 states have internal predecessors, (105248), 0 states have call successors, (0), 0 states 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:29:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76527 states to 76527 states and 105248 transitions. [2025-03-16 19:29:37,428 INFO L78 Accepts]: Start accepts. Automaton has 76527 states and 105248 transitions. Word has length 102 [2025-03-16 19:29:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 76527 states and 105248 transitions. [2025-03-16 19:29:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:29:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 76527 states and 105248 transitions. [2025-03-16 19:29:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:29:37,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:37,441 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] [2025-03-16 19:29:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 19:29:37,442 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 8228723, now seen corresponding path program 1 times [2025-03-16 19:29:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174602646] [2025-03-16 19:29:37,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:37,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:29:37,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:29:37,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:37,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:37,638 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:29:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174602646] [2025-03-16 19:29:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174602646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206228335] [2025-03-16 19:29:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:37,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:37,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:37,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:37,639 INFO L87 Difference]: Start difference. First operand 76527 states and 105248 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:29:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:38,228 INFO L93 Difference]: Finished difference Result 216491 states and 298426 transitions. [2025-03-16 19:29:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:38,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 19:29:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:38,416 INFO L225 Difference]: With dead ends: 216491 [2025-03-16 19:29:38,416 INFO L226 Difference]: Without dead ends: 143033 [2025-03-16 19:29:38,497 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:29:38,498 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 171 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:38,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1227 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143033 states. [2025-03-16 19:29:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143033 to 131899. [2025-03-16 19:29:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131899 states, 131898 states have (on average 1.3729700222899512) internal successors, (181092), 131898 states have internal predecessors, (181092), 0 states have call successors, (0), 0 states 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:29:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131899 states to 131899 states and 181092 transitions. [2025-03-16 19:29:39,924 INFO L78 Accepts]: Start accepts. Automaton has 131899 states and 181092 transitions. Word has length 103 [2025-03-16 19:29:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:39,925 INFO L471 AbstractCegarLoop]: Abstraction has 131899 states and 181092 transitions. [2025-03-16 19:29:39,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:29:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 131899 states and 181092 transitions. [2025-03-16 19:29:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:29:39,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:39,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:39,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-16 19:29:39,938 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:39,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash 222935419, now seen corresponding path program 1 times [2025-03-16 19:29:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556149442] [2025-03-16 19:29:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:29:39,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:29:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:39,991 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:29:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:39,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556149442] [2025-03-16 19:29:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556149442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:39,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103410927] [2025-03-16 19:29:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:39,992 INFO L87 Difference]: Start difference. First operand 131899 states and 181092 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:40,624 INFO L93 Difference]: Finished difference Result 181172 states and 247484 transitions. [2025-03-16 19:29:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 19:29:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:40,770 INFO L225 Difference]: With dead ends: 181172 [2025-03-16 19:29:40,771 INFO L226 Difference]: Without dead ends: 118114 [2025-03-16 19:29:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:40,822 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 396 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:40,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1264 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118114 states. [2025-03-16 19:29:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118114 to 118112. [2025-03-16 19:29:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118112 states, 118111 states have (on average 1.355834765601849) internal successors, (160139), 118111 states have internal predecessors, (160139), 0 states have call successors, (0), 0 states 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:29:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118112 states to 118112 states and 160139 transitions. [2025-03-16 19:29:42,148 INFO L78 Accepts]: Start accepts. Automaton has 118112 states and 160139 transitions. Word has length 106 [2025-03-16 19:29:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 118112 states and 160139 transitions. [2025-03-16 19:29:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 118112 states and 160139 transitions. [2025-03-16 19:29:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:29:42,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:42,158 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] [2025-03-16 19:29:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-16 19:29:42,158 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1452265218, now seen corresponding path program 1 times [2025-03-16 19:29:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693825826] [2025-03-16 19:29:42,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:42,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:29:42,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:29:42,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:42,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:42,231 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:29:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693825826] [2025-03-16 19:29:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693825826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:42,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:42,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803000461] [2025-03-16 19:29:42,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:42,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:42,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:42,232 INFO L87 Difference]: Start difference. First operand 118112 states and 160139 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:43,608 INFO L93 Difference]: Finished difference Result 340516 states and 461645 transitions. [2025-03-16 19:29:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 19:29:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:43,952 INFO L225 Difference]: With dead ends: 340516 [2025-03-16 19:29:43,952 INFO L226 Difference]: Without dead ends: 225314 [2025-03-16 19:29:44,041 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:29:44,042 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 129 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:44,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1219 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225314 states. [2025-03-16 19:29:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225314 to 212768. [2025-03-16 19:29:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212768 states, 212767 states have (on average 1.3484562925641663) internal successors, (286907), 212767 states have internal predecessors, (286907), 0 states have call successors, (0), 0 states 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:29:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212768 states to 212768 states and 286907 transitions. [2025-03-16 19:29:46,745 INFO L78 Accepts]: Start accepts. Automaton has 212768 states and 286907 transitions. Word has length 106 [2025-03-16 19:29:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 212768 states and 286907 transitions. [2025-03-16 19:29:46,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 212768 states and 286907 transitions. [2025-03-16 19:29:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:29:46,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:46,755 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] [2025-03-16 19:29:46,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-16 19:29:46,755 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:46,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1390812699, now seen corresponding path program 1 times [2025-03-16 19:29:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722232403] [2025-03-16 19:29:46,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:46,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:46,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:29:46,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:29:46,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722232403] [2025-03-16 19:29:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722232403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343916857] [2025-03-16 19:29:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:47,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:29:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:47,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:29:47,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:29:47,192 INFO L87 Difference]: Start difference. First operand 212768 states and 286907 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:29:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:47,683 INFO L93 Difference]: Finished difference Result 226786 states and 305596 transitions. [2025-03-16 19:29:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:29:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 19:29:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:48,205 INFO L225 Difference]: With dead ends: 226786 [2025-03-16 19:29:48,206 INFO L226 Difference]: Without dead ends: 226784 [2025-03-16 19:29:48,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:29:48,248 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 0 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:48,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226784 states.