./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-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.4.2.ufo.BOUNDED-8.pals.c.v+sep-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 d0b255ca8288d7fec2d600e13b499a216c3c13b3ba13eac2e9a1248f762a9435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:26:42,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:26:42,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:26:42,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:26:42,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:26:42,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:26:42,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:26:42,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:26:42,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:26:42,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:26:42,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:26:42,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:26:42,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:26:42,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:26:42,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:26:42,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:26:42,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:26:42,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:26:42,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:42,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:26:42,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:26:42,256 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 -> d0b255ca8288d7fec2d600e13b499a216c3c13b3ba13eac2e9a1248f762a9435 [2025-03-16 19:26:42,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:26:42,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:26:42,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:26:42,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:26:42,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:26:42,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:26:43,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a35e26c3/c2d0cc7e215842e3b0745e06fc0e145c/FLAGc01301b7a [2025-03-16 19:26:44,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:26:44,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:26:44,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a35e26c3/c2d0cc7e215842e3b0745e06fc0e145c/FLAGc01301b7a [2025-03-16 19:26:44,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a35e26c3/c2d0cc7e215842e3b0745e06fc0e145c [2025-03-16 19:26:44,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:26:44,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:26:44,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:44,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:26:44,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:26:44,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:44" (1/1) ... [2025-03-16 19:26:44,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293ba498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:44, skipping insertion in model container [2025-03-16 19:26:44,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:44" (1/1) ... [2025-03-16 19:26:44,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:26:44,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32048,32061] [2025-03-16 19:26:44,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[55802,55815] [2025-03-16 19:26:44,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[64372,64385] [2025-03-16 19:26:44,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[91775,91788] [2025-03-16 19:26:44,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[106857,106870] [2025-03-16 19:26:44,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[123963,123976] [2025-03-16 19:26:44,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[141761,141774] [2025-03-16 19:26:45,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:45,023 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:26:45,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32048,32061] [2025-03-16 19:26:45,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[55802,55815] [2025-03-16 19:26:45,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[64372,64385] [2025-03-16 19:26:45,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[91775,91788] [2025-03-16 19:26:45,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[106857,106870] [2025-03-16 19:26:45,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[123963,123976] [2025-03-16 19:26:45,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[141761,141774] [2025-03-16 19:26:45,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:45,310 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:26:45,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45 WrapperNode [2025-03-16 19:26:45,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:45,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:45,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:26:45,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:26:45,353 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:26:45" (1/1) ... [2025-03-16 19:26:45,392 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:26:45" (1/1) ... [2025-03-16 19:26:45,517 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10246 [2025-03-16 19:26:45,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:45,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:26:45,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:26:45,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:26:45,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,605 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:26:45,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:26:45,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:26:45,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:26:45,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:26:45,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (1/1) ... [2025-03-16 19:26:45,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:45,744 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:26:45,779 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:26:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:26:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:26:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:26:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:26:46,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:26:46,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:26:49,813 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027: havoc main_~check__tmp~2#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1; [2025-03-16 19:26:49,813 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13451: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6848: havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15833: havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2623: havoc main_~node2__m2~7#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7909: havoc main_~node3__m3~50#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6588: havoc main_~node2__m2~21#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12403: havoc main_~node3__m3~71#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~72#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3420: havoc main_~node3__m3~22#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16634: havoc main_~node4__m4~89#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~69#1;havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~96#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: havoc main_~node2__m2~5#1; [2025-03-16 19:26:49,814 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7124: havoc main_~node2__m2~23#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12145: havoc main_~node4__m4~67#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7919: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~node2__m2~2#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8716: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~28#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8981: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6871: havoc main_~node2__m2~22#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7928: havoc main_~node4__m4~44#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4494: havoc main_~node2__m2~15#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16122: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~93#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~92#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16915: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~71#1;havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~98#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~70#1;havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~97#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-16 19:26:49,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node3__m3~13#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14802: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4760: havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12953: havoc main_~node4__m4~70#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~75#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8461: havoc main_~node4__m4~47#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5028: havoc main_~node2__m2~17#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13486: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15337: havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~88#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~87#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10847: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~63#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-16 19:26:49,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13227: havoc main_~node2__m2~49#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3187: havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~14#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6627: havoc main_~node4__m4~35#1;havoc main_~node3__m3~42#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~node3__m3~25#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14293: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11915: havoc main_~node3__m3~68#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~69#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc main_~node4__m4~52#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4783: havoc main_~node2__m2~16#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17205: havoc main_~node2____CPAchecker_TMP_1~9#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~73#1;havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~100#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~72#1;havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~99#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10072: havoc main_~node1____CPAchecker_TMP_0~9#1;havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~34#1; [2025-03-16 19:26:49,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9808: havoc main_~node4__m4~55#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11398: havoc main_~node1____CPAchecker_TMP_0~12#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~66#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1621: havoc main_~check__tmp~5#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1357: havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13514: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5851: havoc main_~node4__m4~30#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16422: havoc main_~node1__m1~68#1;havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: havoc main_~node2__m2~10#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3740: havoc main_~node4__m4~16#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5590: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~36#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4533: havoc main_~node4__m4~21#1;havoc main_~node3__m3~30#1; [2025-03-16 19:26:49,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13784: havoc main_~node2__m2~51#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~78#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12728: havoc main_~node1____CPAchecker_TMP_0~13#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~74#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~73#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc main_~node4__m4~84#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7444: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334: havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~35#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11677: havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~68#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~67#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13794: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10361: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: havoc main_~check__tmp~7#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: havoc main_~node3__m3~14#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13271: havoc main_~node3__m3~76#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15122: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc main_~node3__m3~19#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7991: havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6143: havoc main_~check__tmp~32#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~39#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16715: havoc main_~node4__m4~90#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12487: havoc main_~node3__m3~72#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8260: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~26#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4032: havoc main_~check__tmp~18#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~27#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: havoc main_~node2__m2~9#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~13#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: havoc main_~check__tmp~1#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2025-03-16 19:26:49,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7207: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~46#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10643: havoc main_~node2__m2~37#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6417: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~41#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6946: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~44#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12497: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11176: havoc main_~node4__m4~63#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13823: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15938: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10653: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15148: havoc main_~node3__m3~82#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12506: havoc main_~node4__m4~68#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9338: havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2203: havoc main_~node2__m2~6#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~9#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2997: havoc main_~node3__m3~17#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12247: havoc main_~node3__m3~70#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~71#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-16 19:26:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13040: havoc main_~node4__m4~71#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8548: havoc main_~node4__m4~48#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10663: havoc main_~node3__m3~63#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11985: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9607: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~32#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~29#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15158: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6704: havoc main_~node4__m4~36#1;havoc main_~node3__m3~43#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13312: havoc main_~node4__m4~73#1; [2025-03-16 19:26:49,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5914: havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4858: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~32#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10673: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803: havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15167: havoc main_~node4__m4~81#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17021: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc main_~node1____CPAchecker_TMP_0~6#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~49#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10682: havoc main_~node4__m4~60#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9889: havoc main_~node4__m4~56#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: havoc main_~node3__m3~20#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2758: havoc main_~node2__m2~8#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7516: havoc main_~node2__m2~24#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-16 19:26:49,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4610: havoc main_~node4__m4~22#1;havoc main_~node3__m3~31#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15449: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5937: havoc main_~node2__m2~19#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10959: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node3__m3~0#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14396: havoc main_~node4__m4~77#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~82#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3826: havoc main_~node2__m2~13#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3562: havoc main_~node2__m2~12#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~15#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14661: havoc main_~node2__m2~55#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~83#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16252: havoc main_~node4__m4~87#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14671: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~node3__m3~15#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13616: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-16 19:26:49,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~node3__m3~18#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6221: havoc main_~node2__m2~20#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L672: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node4__m4~0#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1466: havoc main_~node4__m4~7#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4110: havoc main_~node2__m2~14#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13360: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3584: havoc main_~node3__m3~23#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5435: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16534: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209: havoc main_~node2__m2~3#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~3#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5174: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~34#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8611: havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11520: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8879: havoc main_~node1____CPAchecker_TMP_0~7#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~29#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8351: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12317: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14171: havoc main_~node1____CPAchecker_TMP_0~14#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~81#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~80#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8093: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~25#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9150: havoc main_~node1____CPAchecker_TMP_0~8#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12850: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14700: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2283: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~10#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1; [2025-03-16 19:26:49,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1758: havoc main_~check__tmp~6#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6516: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: havoc main_~node2__m2~11#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14973: havoc main_~node2__m2~57#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~86#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~85#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9952: havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13388: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5725: havoc main_~node1____CPAchecker_TMP_0~3#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~37#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6785: havoc main_~node4__m4~37#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12071: havoc main_~node3__m3~69#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~70#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2032: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~8#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9698: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14983: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11813: havoc main_~node4__m4~66#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7058: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~45#1; [2025-03-16 19:26:49,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2833: havoc main_~node3__m3~16#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9440: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~31#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~check__tmp~31#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~38#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3895: havoc main_~check__tmp~17#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~26#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: havoc main_~node3__m3~21#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3637: havoc main_~node3__m3~24#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4961: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~33#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4697: havoc main_~node4__m4~23#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7342: havoc main_~node1____CPAchecker_TMP_0~4#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~47#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14477: havoc main_~node4__m4~78#1; [2025-03-16 19:26:49,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13949: havoc main_~node4__m4~75#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13423: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6290: havoc main_~check__tmp~33#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~40#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15012: havoc main_~node2____CPAchecker_TMP_1~4#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7614: havoc main_~node1____CPAchecker_TMP_0~5#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~48#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3124: havoc main_~node4__m4~15#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10260: havoc main_~node1____CPAchecker_TMP_0~10#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~59#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~35#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7883: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5507: havoc main_~node2__m2~18#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15549: havoc main_~node4__m4~83#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~89#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10530: havoc main_~node1____CPAchecker_TMP_0~11#1;havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~61#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~60#1; [2025-03-16 19:26:49,827 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4193: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~28#1; [2025-03-16 19:26:49,828 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node2__m2~1#1; [2025-03-16 19:26:49,828 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1552: havoc main_~node2__m2~4#1; [2025-03-16 19:26:49,828 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11067: havoc main_~node4__m4~62#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-16 19:26:50,169 INFO L? ?]: Removed 1980 outVars from TransFormulas that were not future-live. [2025-03-16 19:26:50,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:26:50,210 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:26:50,210 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:26:50,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:50 BoogieIcfgContainer [2025-03-16 19:26:50,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:26:50,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:26:50,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:26:50,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:26:50,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:26:44" (1/3) ... [2025-03-16 19:26:50,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:50, skipping insertion in model container [2025-03-16 19:26:50,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:45" (2/3) ... [2025-03-16 19:26:50,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:50, skipping insertion in model container [2025-03-16 19:26:50,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:50" (3/3) ... [2025-03-16 19:26:50,219 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:26:50,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:26:50,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 2045 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-16 19:26:50,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:26:50,338 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;@30d4e9a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:26:50,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-16 19:26:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 2045 states, 2037 states have (on average 1.7766323024054982) internal successors, (3619), 2044 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:26:50,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:50,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:50,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1924670657, now seen corresponding path program 1 times [2025-03-16 19:26:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377529848] [2025-03-16 19:26:50,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:26:50,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:26:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:50,940 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:26:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377529848] [2025-03-16 19:26:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377529848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471985043] [2025-03-16 19:26:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:50,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:50,974 INFO L87 Difference]: Start difference. First operand has 2045 states, 2037 states have (on average 1.7766323024054982) internal successors, (3619), 2044 states have internal predecessors, (3619), 0 states have call successors, (0), 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 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:52,444 INFO L93 Difference]: Finished difference Result 3315 states and 5748 transitions. [2025-03-16 19:26:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:26:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:52,461 INFO L225 Difference]: With dead ends: 3315 [2025-03-16 19:26:52,461 INFO L226 Difference]: Without dead ends: 2140 [2025-03-16 19:26:52,468 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:26:52,475 INFO L435 NwaCegarLoop]: 1724 mSDtfsCounter, 10212 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10212 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:52,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10212 Valid, 2251 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:26:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-16 19:26:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2125. [2025-03-16 19:26:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2118 states have (on average 1.3035882908404155) internal successors, (2761), 2124 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2761 transitions. [2025-03-16 19:26:52,590 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2761 transitions. Word has length 64 [2025-03-16 19:26:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:52,590 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2761 transitions. [2025-03-16 19:26:52,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2761 transitions. [2025-03-16 19:26:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:52,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:52,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:52,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:26:52,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:52,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1149353973, now seen corresponding path program 1 times [2025-03-16 19:26:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740658606] [2025-03-16 19:26:52,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740658606] [2025-03-16 19:26:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740658606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580656460] [2025-03-16 19:26:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:52,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:52,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:52,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:52,824 INFO L87 Difference]: Start difference. First operand 2125 states and 2761 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:53,917 INFO L93 Difference]: Finished difference Result 3786 states and 4929 transitions. [2025-03-16 19:26:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:26:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:53,929 INFO L225 Difference]: With dead ends: 3786 [2025-03-16 19:26:53,929 INFO L226 Difference]: Without dead ends: 2510 [2025-03-16 19:26:53,933 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:26:53,933 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 6514 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6514 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:53,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6514 Valid, 1254 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:26:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2025-03-16 19:26:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2500. [2025-03-16 19:26:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2493 states have (on average 1.3060569594865623) internal successors, (3256), 2499 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3256 transitions. [2025-03-16 19:26:54,000 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3256 transitions. Word has length 65 [2025-03-16 19:26:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3256 transitions. [2025-03-16 19:26:54,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3256 transitions. [2025-03-16 19:26:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:54,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:54,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:26:54,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -805427083, now seen corresponding path program 1 times [2025-03-16 19:26:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548436298] [2025-03-16 19:26:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:54,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:54,179 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:26:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548436298] [2025-03-16 19:26:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548436298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:54,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20553813] [2025-03-16 19:26:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:54,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:54,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:54,181 INFO L87 Difference]: Start difference. First operand 2500 states and 3256 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:55,081 INFO L93 Difference]: Finished difference Result 5232 states and 6851 transitions. [2025-03-16 19:26:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:55,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:26:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:55,091 INFO L225 Difference]: With dead ends: 5232 [2025-03-16 19:26:55,091 INFO L226 Difference]: Without dead ends: 3593 [2025-03-16 19:26:55,094 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:26:55,094 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 6268 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6268 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:55,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6268 Valid, 1265 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:26:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2025-03-16 19:26:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3577. [2025-03-16 19:26:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3570 states have (on average 1.2907563025210085) internal successors, (4608), 3576 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4608 transitions. [2025-03-16 19:26:55,155 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4608 transitions. Word has length 65 [2025-03-16 19:26:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:55,155 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 4608 transitions. [2025-03-16 19:26:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4608 transitions. [2025-03-16 19:26:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:55,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:55,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:26:55,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1458078099, now seen corresponding path program 1 times [2025-03-16 19:26:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410510775] [2025-03-16 19:26:55,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:55,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:55,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:55,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:55,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:55,370 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:26:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410510775] [2025-03-16 19:26:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410510775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:55,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106487943] [2025-03-16 19:26:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:55,372 INFO L87 Difference]: Start difference. First operand 3577 states and 4608 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:56,248 INFO L93 Difference]: Finished difference Result 8116 states and 10645 transitions. [2025-03-16 19:26:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:26:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:56,261 INFO L225 Difference]: With dead ends: 8116 [2025-03-16 19:26:56,261 INFO L226 Difference]: Without dead ends: 5316 [2025-03-16 19:26:56,265 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:26:56,266 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 6583 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6583 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:56,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6583 Valid, 1318 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:26:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2025-03-16 19:26:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 5310. [2025-03-16 19:26:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5310 states, 5303 states have (on average 1.3002074297567414) internal successors, (6895), 5309 states have internal predecessors, (6895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5310 states to 5310 states and 6895 transitions. [2025-03-16 19:26:56,346 INFO L78 Accepts]: Start accepts. Automaton has 5310 states and 6895 transitions. Word has length 66 [2025-03-16 19:26:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:56,346 INFO L471 AbstractCegarLoop]: Abstraction has 5310 states and 6895 transitions. [2025-03-16 19:26:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 6895 transitions. [2025-03-16 19:26:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:56,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:56,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:56,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:26:56,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:56,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1074895767, now seen corresponding path program 1 times [2025-03-16 19:26:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:56,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290617312] [2025-03-16 19:26:56,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:56,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:56,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:56,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:56,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:56,790 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:26:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290617312] [2025-03-16 19:26:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290617312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:26:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848529799] [2025-03-16 19:26:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:26:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:56,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:26:56,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:56,791 INFO L87 Difference]: Start difference. First operand 5310 states and 6895 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:58,763 INFO L93 Difference]: Finished difference Result 8265 states and 10984 transitions. [2025-03-16 19:26:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:26:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:58,778 INFO L225 Difference]: With dead ends: 8265 [2025-03-16 19:26:58,779 INFO L226 Difference]: Without dead ends: 6820 [2025-03-16 19:26:58,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:26:58,783 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 6308 mSDsluCounter, 3956 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6308 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:58,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6308 Valid, 4863 Invalid, 4715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:26:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2025-03-16 19:26:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5317. [2025-03-16 19:26:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5310 states have (on average 1.2998116760828626) internal successors, (6902), 5316 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 6902 transitions. [2025-03-16 19:26:58,873 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 6902 transitions. Word has length 66 [2025-03-16 19:26:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 6902 transitions. [2025-03-16 19:26:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 6902 transitions. [2025-03-16 19:26:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:58,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:58,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:58,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:26:58,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1682242619, now seen corresponding path program 1 times [2025-03-16 19:26:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186614917] [2025-03-16 19:26:58,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:58,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:58,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:58,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:58,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:59,185 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:26:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186614917] [2025-03-16 19:26:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186614917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:59,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:59,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120185389] [2025-03-16 19:26:59,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:59,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:59,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:59,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:59,187 INFO L87 Difference]: Start difference. First operand 5317 states and 6902 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:00,674 INFO L93 Difference]: Finished difference Result 6515 states and 8524 transitions. [2025-03-16 19:27:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:00,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:27:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:00,690 INFO L225 Difference]: With dead ends: 6515 [2025-03-16 19:27:00,690 INFO L226 Difference]: Without dead ends: 6509 [2025-03-16 19:27:00,692 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:27:00,692 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 6704 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6704 SdHoareTripleChecker+Valid, 3986 SdHoareTripleChecker+Invalid, 3459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:00,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6704 Valid, 3986 Invalid, 3459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:27:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2025-03-16 19:27:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 5317. [2025-03-16 19:27:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5310 states have (on average 1.299623352165725) internal successors, (6901), 5316 states have internal predecessors, (6901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 6901 transitions. [2025-03-16 19:27:00,810 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 6901 transitions. Word has length 67 [2025-03-16 19:27:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:00,810 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 6901 transitions. [2025-03-16 19:27:00,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 6901 transitions. [2025-03-16 19:27:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:27:00,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:00,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:00,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:27:00,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1541325596, now seen corresponding path program 1 times [2025-03-16 19:27:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452129957] [2025-03-16 19:27:00,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:00,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:27:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:27:00,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:00,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:00,891 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:27:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452129957] [2025-03-16 19:27:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452129957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591250453] [2025-03-16 19:27:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:00,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:00,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:00,893 INFO L87 Difference]: Start difference. First operand 5317 states and 6901 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:01,090 INFO L93 Difference]: Finished difference Result 10621 states and 13945 transitions. [2025-03-16 19:27:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:01,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:27:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:01,104 INFO L225 Difference]: With dead ends: 10621 [2025-03-16 19:27:01,104 INFO L226 Difference]: Without dead ends: 6512 [2025-03-16 19:27:01,109 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:27:01,110 INFO L435 NwaCegarLoop]: 1615 mSDtfsCounter, 1612 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2167 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2025-03-16 19:27:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 6501. [2025-03-16 19:27:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6494 states have (on average 1.2990452725592856) internal successors, (8436), 6500 states have internal predecessors, (8436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 8436 transitions. [2025-03-16 19:27:01,185 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 8436 transitions. Word has length 67 [2025-03-16 19:27:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 6501 states and 8436 transitions. [2025-03-16 19:27:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 8436 transitions. [2025-03-16 19:27:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:27:01,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:01,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:27:01,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:01,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2044147303, now seen corresponding path program 1 times [2025-03-16 19:27:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156089882] [2025-03-16 19:27:01,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:01,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:27:01,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:27:01,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:01,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:01,651 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:27:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156089882] [2025-03-16 19:27:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156089882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:01,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:01,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:27:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495684151] [2025-03-16 19:27:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:27:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:01,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:27:01,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:27:01,653 INFO L87 Difference]: Start difference. First operand 6501 states and 8436 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:02,577 INFO L93 Difference]: Finished difference Result 8949 states and 11932 transitions. [2025-03-16 19:27:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:27:02,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:27:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:02,592 INFO L225 Difference]: With dead ends: 8949 [2025-03-16 19:27:02,592 INFO L226 Difference]: Without dead ends: 8945 [2025-03-16 19:27:02,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:02,596 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6599 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6599 SdHoareTripleChecker+Valid, 8163 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:02,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6599 Valid, 8163 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8945 states. [2025-03-16 19:27:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8945 to 6497. [2025-03-16 19:27:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 6491 states have (on average 1.2990294253581882) internal successors, (8432), 6496 states have internal predecessors, (8432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 8432 transitions. [2025-03-16 19:27:02,679 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 8432 transitions. Word has length 67 [2025-03-16 19:27:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:02,679 INFO L471 AbstractCegarLoop]: Abstraction has 6497 states and 8432 transitions. [2025-03-16 19:27:02,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 8432 transitions. [2025-03-16 19:27:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:27:02,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:02,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:27:02,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:02,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1848044279, now seen corresponding path program 1 times [2025-03-16 19:27:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977884640] [2025-03-16 19:27:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:02,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:27:02,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:27:02,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:02,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:02,986 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:27:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977884640] [2025-03-16 19:27:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977884640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:02,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642063305] [2025-03-16 19:27:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:02,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:02,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:02,988 INFO L87 Difference]: Start difference. First operand 6497 states and 8432 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:04,685 INFO L93 Difference]: Finished difference Result 10520 states and 14094 transitions. [2025-03-16 19:27:04,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:04,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:27:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:04,698 INFO L225 Difference]: With dead ends: 10520 [2025-03-16 19:27:04,698 INFO L226 Difference]: Without dead ends: 8574 [2025-03-16 19:27:04,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:27:04,703 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 6382 mSDsluCounter, 3885 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 4349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:04,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 4801 Invalid, 4349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4321 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:27:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8574 states. [2025-03-16 19:27:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8574 to 6469. [2025-03-16 19:27:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6469 states, 6463 states have (on average 1.2995512919696734) internal successors, (8399), 6468 states have internal predecessors, (8399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 8399 transitions. [2025-03-16 19:27:04,786 INFO L78 Accepts]: Start accepts. Automaton has 6469 states and 8399 transitions. Word has length 68 [2025-03-16 19:27:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:04,786 INFO L471 AbstractCegarLoop]: Abstraction has 6469 states and 8399 transitions. [2025-03-16 19:27:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6469 states and 8399 transitions. [2025-03-16 19:27:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:27:04,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:04,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:04,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:27:04,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:04,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash -112074526, now seen corresponding path program 1 times [2025-03-16 19:27:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:04,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170888461] [2025-03-16 19:27:04,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:04,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:27:04,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:27:04,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:04,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:05,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:27:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170888461] [2025-03-16 19:27:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170888461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611684241] [2025-03-16 19:27:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:05,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:05,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:05,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:05,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:05,347 INFO L87 Difference]: Start difference. First operand 6469 states and 8399 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:06,369 INFO L93 Difference]: Finished difference Result 10286 states and 13856 transitions. [2025-03-16 19:27:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:06,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:27:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:06,379 INFO L225 Difference]: With dead ends: 10286 [2025-03-16 19:27:06,379 INFO L226 Difference]: Without dead ends: 8323 [2025-03-16 19:27:06,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:27:06,384 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 10871 mSDsluCounter, 9109 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10871 SdHoareTripleChecker+Valid, 10634 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:06,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10871 Valid, 10634 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2025-03-16 19:27:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 6420. [2025-03-16 19:27:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 6415 states have (on average 1.3007014809041308) internal successors, (8344), 6419 states have internal predecessors, (8344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 8344 transitions. [2025-03-16 19:27:06,469 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 8344 transitions. Word has length 68 [2025-03-16 19:27:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:06,470 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 8344 transitions. [2025-03-16 19:27:06,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 8344 transitions. [2025-03-16 19:27:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:27:06,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:06,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:06,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:27:06,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:06,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1036692817, now seen corresponding path program 1 times [2025-03-16 19:27:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764004013] [2025-03-16 19:27:06,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:06,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:27:06,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:27:06,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:06,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:07,059 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:27:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764004013] [2025-03-16 19:27:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764004013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:07,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:07,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745952376] [2025-03-16 19:27:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:07,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:07,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:07,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:07,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:07,061 INFO L87 Difference]: Start difference. First operand 6420 states and 8344 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:08,257 INFO L93 Difference]: Finished difference Result 8963 states and 12162 transitions. [2025-03-16 19:27:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:27:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:08,276 INFO L225 Difference]: With dead ends: 8963 [2025-03-16 19:27:08,277 INFO L226 Difference]: Without dead ends: 7014 [2025-03-16 19:27:08,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:27:08,288 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 6566 mSDsluCounter, 7033 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6566 SdHoareTripleChecker+Valid, 8538 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:08,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6566 Valid, 8538 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:27:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2025-03-16 19:27:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 6385. [2025-03-16 19:27:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 6381 states have (on average 1.3015201379094186) internal successors, (8305), 6384 states have internal predecessors, (8305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 8305 transitions. [2025-03-16 19:27:08,398 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 8305 transitions. Word has length 69 [2025-03-16 19:27:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 6385 states and 8305 transitions. [2025-03-16 19:27:08,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 8305 transitions. [2025-03-16 19:27:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:08,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:08,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:08,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:27:08,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:08,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 780182431, now seen corresponding path program 1 times [2025-03-16 19:27:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066962262] [2025-03-16 19:27:08,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:08,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:08,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:08,474 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:27:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066962262] [2025-03-16 19:27:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066962262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:08,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:08,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685350831] [2025-03-16 19:27:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:08,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:08,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:08,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:08,476 INFO L87 Difference]: Start difference. First operand 6385 states and 8305 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:08,586 INFO L93 Difference]: Finished difference Result 10223 states and 13764 transitions. [2025-03-16 19:27:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:08,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:27:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:08,594 INFO L225 Difference]: With dead ends: 10223 [2025-03-16 19:27:08,594 INFO L226 Difference]: Without dead ends: 6204 [2025-03-16 19:27:08,599 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:27:08,599 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 1194 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1676 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2025-03-16 19:27:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6191. [2025-03-16 19:27:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 6188 states have (on average 1.3413057530704589) internal successors, (8300), 6190 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 8300 transitions. [2025-03-16 19:27:08,656 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 8300 transitions. Word has length 70 [2025-03-16 19:27:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 8300 transitions. [2025-03-16 19:27:08,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8300 transitions. [2025-03-16 19:27:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:08,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:08,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:08,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:27:08,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:08,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1615486747, now seen corresponding path program 1 times [2025-03-16 19:27:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:08,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849378502] [2025-03-16 19:27:08,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:08,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:08,860 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:27:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849378502] [2025-03-16 19:27:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849378502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220323283] [2025-03-16 19:27:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:08,862 INFO L87 Difference]: Start difference. First operand 6191 states and 8300 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:09,991 INFO L93 Difference]: Finished difference Result 10957 states and 14950 transitions. [2025-03-16 19:27:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:27:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:10,004 INFO L225 Difference]: With dead ends: 10957 [2025-03-16 19:27:10,005 INFO L226 Difference]: Without dead ends: 10948 [2025-03-16 19:27:10,008 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:27:10,009 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 3368 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3368 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:10,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3368 Valid, 3141 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:27:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10948 states. [2025-03-16 19:27:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10948 to 6191. [2025-03-16 19:27:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 6188 states have (on average 1.3411441499676793) internal successors, (8299), 6190 states have internal predecessors, (8299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 8299 transitions. [2025-03-16 19:27:10,094 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 8299 transitions. Word has length 70 [2025-03-16 19:27:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 8299 transitions. [2025-03-16 19:27:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8299 transitions. [2025-03-16 19:27:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:27:10,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:10,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:10,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:27:10,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 699074690, now seen corresponding path program 1 times [2025-03-16 19:27:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170318363] [2025-03-16 19:27:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:27:10,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:27:10,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:10,486 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:27:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170318363] [2025-03-16 19:27:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170318363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:10,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751633803] [2025-03-16 19:27:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:10,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:10,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:10,488 INFO L87 Difference]: Start difference. First operand 6191 states and 8299 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:12,362 INFO L93 Difference]: Finished difference Result 11868 states and 16327 transitions. [2025-03-16 19:27:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:27:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:27:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:12,371 INFO L225 Difference]: With dead ends: 11868 [2025-03-16 19:27:12,372 INFO L226 Difference]: Without dead ends: 8678 [2025-03-16 19:27:12,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:27:12,377 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 5038 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 4289 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5038 SdHoareTripleChecker+Valid, 4849 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:12,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5038 Valid, 4849 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4289 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:27:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8678 states. [2025-03-16 19:27:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8678 to 6191. [2025-03-16 19:27:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 6188 states have (on average 1.3408209437621201) internal successors, (8297), 6190 states have internal predecessors, (8297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 8297 transitions. [2025-03-16 19:27:12,449 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 8297 transitions. Word has length 71 [2025-03-16 19:27:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 8297 transitions. [2025-03-16 19:27:12,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8297 transitions. [2025-03-16 19:27:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:27:12,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:12,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:27:12,454 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 154623091, now seen corresponding path program 1 times [2025-03-16 19:27:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652746338] [2025-03-16 19:27:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:12,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:27:12,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:27:12,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:12,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:12,931 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:27:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652746338] [2025-03-16 19:27:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652746338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764630006] [2025-03-16 19:27:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:12,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:12,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:12,932 INFO L87 Difference]: Start difference. First operand 6191 states and 8297 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:13,787 INFO L93 Difference]: Finished difference Result 8340 states and 11290 transitions. [2025-03-16 19:27:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:27:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:13,796 INFO L225 Difference]: With dead ends: 8340 [2025-03-16 19:27:13,797 INFO L226 Difference]: Without dead ends: 8328 [2025-03-16 19:27:13,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:27:13,798 INFO L435 NwaCegarLoop]: 1126 mSDtfsCounter, 5792 mSDsluCounter, 6825 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5792 SdHoareTripleChecker+Valid, 7951 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:13,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5792 Valid, 7951 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2025-03-16 19:27:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 6179. [2025-03-16 19:27:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6179 states, 6177 states have (on average 1.3412659867249475) internal successors, (8285), 6178 states have internal predecessors, (8285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6179 states to 6179 states and 8285 transitions. [2025-03-16 19:27:13,855 INFO L78 Accepts]: Start accepts. Automaton has 6179 states and 8285 transitions. Word has length 71 [2025-03-16 19:27:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:13,856 INFO L471 AbstractCegarLoop]: Abstraction has 6179 states and 8285 transitions. [2025-03-16 19:27:13,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6179 states and 8285 transitions. [2025-03-16 19:27:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:13,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:13,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:13,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:27:13,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:13,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -868531983, now seen corresponding path program 1 times [2025-03-16 19:27:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164852211] [2025-03-16 19:27:13,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:13,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:13,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:13,914 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:27:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164852211] [2025-03-16 19:27:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164852211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144905171] [2025-03-16 19:27:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:13,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:13,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:13,916 INFO L87 Difference]: Start difference. First operand 6179 states and 8285 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:14,055 INFO L93 Difference]: Finished difference Result 13147 states and 18231 transitions. [2025-03-16 19:27:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:14,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:27:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:14,065 INFO L225 Difference]: With dead ends: 13147 [2025-03-16 19:27:14,065 INFO L226 Difference]: Without dead ends: 9520 [2025-03-16 19:27:14,070 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:27:14,071 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 787 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:14,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2386 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9520 states. [2025-03-16 19:27:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9520 to 9518. [2025-03-16 19:27:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9518 states, 9516 states have (on average 1.3569777217318202) internal successors, (12913), 9517 states have internal predecessors, (12913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9518 states to 9518 states and 12913 transitions. [2025-03-16 19:27:14,209 INFO L78 Accepts]: Start accepts. Automaton has 9518 states and 12913 transitions. Word has length 72 [2025-03-16 19:27:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 9518 states and 12913 transitions. [2025-03-16 19:27:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9518 states and 12913 transitions. [2025-03-16 19:27:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:14,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:14,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:14,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:27:14,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:14,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1161011570, now seen corresponding path program 1 times [2025-03-16 19:27:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46270911] [2025-03-16 19:27:14,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46270911] [2025-03-16 19:27:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46270911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681616980] [2025-03-16 19:27:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:14,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:14,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:14,471 INFO L87 Difference]: Start difference. First operand 9518 states and 12913 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:15,729 INFO L93 Difference]: Finished difference Result 15413 states and 21460 transitions. [2025-03-16 19:27:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:27:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:15,738 INFO L225 Difference]: With dead ends: 15413 [2025-03-16 19:27:15,739 INFO L226 Difference]: Without dead ends: 9690 [2025-03-16 19:27:15,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:27:15,744 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 4313 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4313 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:15,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4313 Valid, 3538 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3129 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9690 states. [2025-03-16 19:27:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9690 to 9518. [2025-03-16 19:27:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9518 states, 9516 states have (on average 1.3567675493905003) internal successors, (12911), 9517 states have internal predecessors, (12911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9518 states to 9518 states and 12911 transitions. [2025-03-16 19:27:15,863 INFO L78 Accepts]: Start accepts. Automaton has 9518 states and 12911 transitions. Word has length 72 [2025-03-16 19:27:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:15,863 INFO L471 AbstractCegarLoop]: Abstraction has 9518 states and 12911 transitions. [2025-03-16 19:27:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 9518 states and 12911 transitions. [2025-03-16 19:27:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:15,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:15,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:15,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:27:15,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -871707464, now seen corresponding path program 1 times [2025-03-16 19:27:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992678101] [2025-03-16 19:27:15,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:15,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:15,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:16,243 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:27:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992678101] [2025-03-16 19:27:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992678101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:16,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:16,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329933374] [2025-03-16 19:27:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:16,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:16,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:16,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:16,251 INFO L87 Difference]: Start difference. First operand 9518 states and 12911 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:17,529 INFO L93 Difference]: Finished difference Result 18580 states and 25956 transitions. [2025-03-16 19:27:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:27:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:17,542 INFO L225 Difference]: With dead ends: 18580 [2025-03-16 19:27:17,542 INFO L226 Difference]: Without dead ends: 13136 [2025-03-16 19:27:17,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:27:17,549 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 4395 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4395 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:17,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4395 Valid, 3999 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13136 states. [2025-03-16 19:27:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13136 to 9419. [2025-03-16 19:27:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9417 states have (on average 1.3581820112562386) internal successors, (12790), 9418 states have internal predecessors, (12790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 12790 transitions. [2025-03-16 19:27:17,666 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 12790 transitions. Word has length 72 [2025-03-16 19:27:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 12790 transitions. [2025-03-16 19:27:17,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 12790 transitions. [2025-03-16 19:27:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:17,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:17,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:27:17,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1753791939, now seen corresponding path program 1 times [2025-03-16 19:27:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232713579] [2025-03-16 19:27:17,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:17,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:17,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:17,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:17,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:17,835 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:27:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232713579] [2025-03-16 19:27:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232713579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527546430] [2025-03-16 19:27:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:17,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:17,837 INFO L87 Difference]: Start difference. First operand 9419 states and 12790 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:19,174 INFO L93 Difference]: Finished difference Result 16005 states and 22064 transitions. [2025-03-16 19:27:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:27:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:19,188 INFO L225 Difference]: With dead ends: 16005 [2025-03-16 19:27:19,188 INFO L226 Difference]: Without dead ends: 14656 [2025-03-16 19:27:19,193 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:27:19,193 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 4845 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4845 SdHoareTripleChecker+Valid, 3360 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:19,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4845 Valid, 3360 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:27:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14656 states. [2025-03-16 19:27:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14656 to 9419. [2025-03-16 19:27:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9417 states have (on average 1.3580758203249443) internal successors, (12789), 9418 states have internal predecessors, (12789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 12789 transitions. [2025-03-16 19:27:19,348 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 12789 transitions. Word has length 72 [2025-03-16 19:27:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 12789 transitions. [2025-03-16 19:27:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 12789 transitions. [2025-03-16 19:27:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:19,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:19,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:19,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:27:19,354 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1860876293, now seen corresponding path program 1 times [2025-03-16 19:27:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826711778] [2025-03-16 19:27:19,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:19,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:19,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:19,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:19,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826711778] [2025-03-16 19:27:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826711778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:19,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:19,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520393310] [2025-03-16 19:27:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:19,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:19,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:19,502 INFO L87 Difference]: Start difference. First operand 9419 states and 12789 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:19,576 INFO L93 Difference]: Finished difference Result 19644 states and 27889 transitions. [2025-03-16 19:27:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:27:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:19,589 INFO L225 Difference]: With dead ends: 19644 [2025-03-16 19:27:19,589 INFO L226 Difference]: Without dead ends: 13439 [2025-03-16 19:27:19,597 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:27:19,598 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 756 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:19,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1826 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13439 states. [2025-03-16 19:27:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13439 to 13437. [2025-03-16 19:27:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13437 states, 13435 states have (on average 1.39136583550428) internal successors, (18693), 13436 states have internal predecessors, (18693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13437 states to 13437 states and 18693 transitions. [2025-03-16 19:27:19,819 INFO L78 Accepts]: Start accepts. Automaton has 13437 states and 18693 transitions. Word has length 73 [2025-03-16 19:27:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:19,819 INFO L471 AbstractCegarLoop]: Abstraction has 13437 states and 18693 transitions. [2025-03-16 19:27:19,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 13437 states and 18693 transitions. [2025-03-16 19:27:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:19,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:19,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:27:19,824 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -87087438, now seen corresponding path program 1 times [2025-03-16 19:27:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:19,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106443216] [2025-03-16 19:27:19,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:19,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:19,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:19,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:19,891 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:27:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106443216] [2025-03-16 19:27:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106443216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:19,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:19,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807916210] [2025-03-16 19:27:19,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:19,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:19,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:19,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:19,893 INFO L87 Difference]: Start difference. First operand 13437 states and 18693 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:19,981 INFO L93 Difference]: Finished difference Result 29035 states and 41572 transitions. [2025-03-16 19:27:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:19,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:27:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:20,002 INFO L225 Difference]: With dead ends: 29035 [2025-03-16 19:27:20,002 INFO L226 Difference]: Without dead ends: 18498 [2025-03-16 19:27:20,015 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:27:20,016 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 718 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:20,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1813 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18498 states. [2025-03-16 19:27:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18498 to 14830. [2025-03-16 19:27:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14830 states, 14828 states have (on average 1.4037631507957917) internal successors, (20815), 14829 states have internal predecessors, (20815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14830 states to 14830 states and 20815 transitions. [2025-03-16 19:27:20,198 INFO L78 Accepts]: Start accepts. Automaton has 14830 states and 20815 transitions. Word has length 73 [2025-03-16 19:27:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:20,198 INFO L471 AbstractCegarLoop]: Abstraction has 14830 states and 20815 transitions. [2025-03-16 19:27:20,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 14830 states and 20815 transitions. [2025-03-16 19:27:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:27:20,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:20,202 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:27:20,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:27:20,202 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:20,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash -409246757, now seen corresponding path program 1 times [2025-03-16 19:27:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351461176] [2025-03-16 19:27:20,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:27:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:27:20,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:20,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:20,241 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:27:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351461176] [2025-03-16 19:27:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351461176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726552966] [2025-03-16 19:27:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:20,242 INFO L87 Difference]: Start difference. First operand 14830 states and 20815 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:27:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:20,346 INFO L93 Difference]: Finished difference Result 30951 states and 43983 transitions. [2025-03-16 19:27:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:20,346 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:27:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:20,364 INFO L225 Difference]: With dead ends: 30951 [2025-03-16 19:27:20,364 INFO L226 Difference]: Without dead ends: 17129 [2025-03-16 19:27:20,378 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:27:20,380 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1105 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:20,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1627 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17129 states. [2025-03-16 19:27:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17129 to 13723. [2025-03-16 19:27:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13723 states, 13721 states have (on average 1.4170978791633262) internal successors, (19444), 13722 states have internal predecessors, (19444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13723 states to 13723 states and 19444 transitions. [2025-03-16 19:27:20,725 INFO L78 Accepts]: Start accepts. Automaton has 13723 states and 19444 transitions. Word has length 74 [2025-03-16 19:27:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 13723 states and 19444 transitions. [2025-03-16 19:27:20,726 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:27:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13723 states and 19444 transitions. [2025-03-16 19:27:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:27:20,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:20,730 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:27:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:27:20,730 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -218477679, now seen corresponding path program 1 times [2025-03-16 19:27:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781993549] [2025-03-16 19:27:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:20,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:27:20,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:27:20,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:20,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:20,965 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:27:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781993549] [2025-03-16 19:27:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781993549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:20,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627339192] [2025-03-16 19:27:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:20,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:20,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:20,967 INFO L87 Difference]: Start difference. First operand 13723 states and 19444 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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:27:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:21,915 INFO L93 Difference]: Finished difference Result 17608 states and 24809 transitions. [2025-03-16 19:27:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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:27:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:21,930 INFO L225 Difference]: With dead ends: 17608 [2025-03-16 19:27:21,930 INFO L226 Difference]: Without dead ends: 17392 [2025-03-16 19:27:21,932 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:27:21,933 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 4379 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:21,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4379 Valid, 2679 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17392 states. [2025-03-16 19:27:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17392 to 13718. [2025-03-16 19:27:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13718 states, 13716 states have (on average 1.4169582968795567) internal successors, (19435), 13717 states have internal predecessors, (19435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13718 states to 13718 states and 19435 transitions. [2025-03-16 19:27:22,057 INFO L78 Accepts]: Start accepts. Automaton has 13718 states and 19435 transitions. Word has length 74 [2025-03-16 19:27:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:22,057 INFO L471 AbstractCegarLoop]: Abstraction has 13718 states and 19435 transitions. [2025-03-16 19:27:22,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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:27:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13718 states and 19435 transitions. [2025-03-16 19:27:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:22,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:22,059 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:27:22,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:27:22,059 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:22,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1894319811, now seen corresponding path program 1 times [2025-03-16 19:27:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:22,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394335368] [2025-03-16 19:27:22,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:22,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:22,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:22,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:22,252 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:27:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394335368] [2025-03-16 19:27:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394335368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917662042] [2025-03-16 19:27:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:22,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:22,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:22,253 INFO L87 Difference]: Start difference. First operand 13718 states and 19435 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:23,261 INFO L93 Difference]: Finished difference Result 17656 states and 24852 transitions. [2025-03-16 19:27:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:23,279 INFO L225 Difference]: With dead ends: 17656 [2025-03-16 19:27:23,279 INFO L226 Difference]: Without dead ends: 17420 [2025-03-16 19:27:23,284 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:27:23,284 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 4200 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4200 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4200 Valid, 2826 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:27:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17420 states. [2025-03-16 19:27:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17420 to 13718. [2025-03-16 19:27:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13718 states, 13716 states have (on average 1.4168853893263342) internal successors, (19434), 13717 states have internal predecessors, (19434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13718 states to 13718 states and 19434 transitions. [2025-03-16 19:27:23,427 INFO L78 Accepts]: Start accepts. Automaton has 13718 states and 19434 transitions. Word has length 75 [2025-03-16 19:27:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:23,427 INFO L471 AbstractCegarLoop]: Abstraction has 13718 states and 19434 transitions. [2025-03-16 19:27:23,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 13718 states and 19434 transitions. [2025-03-16 19:27:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:23,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:23,429 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:27:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:27:23,429 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1953849086, now seen corresponding path program 1 times [2025-03-16 19:27:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535593300] [2025-03-16 19:27:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:23,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:23,615 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:27:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535593300] [2025-03-16 19:27:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535593300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:23,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997847081] [2025-03-16 19:27:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:23,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:23,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:23,617 INFO L87 Difference]: Start difference. First operand 13718 states and 19434 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:24,501 INFO L93 Difference]: Finished difference Result 17606 states and 24802 transitions. [2025-03-16 19:27:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:24,519 INFO L225 Difference]: With dead ends: 17606 [2025-03-16 19:27:24,519 INFO L226 Difference]: Without dead ends: 17392 [2025-03-16 19:27:24,524 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:27:24,525 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 4333 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:24,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 2730 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17392 states. [2025-03-16 19:27:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17392 to 13718. [2025-03-16 19:27:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13718 states, 13716 states have (on average 1.4168124817731116) internal successors, (19433), 13717 states have internal predecessors, (19433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13718 states to 13718 states and 19433 transitions. [2025-03-16 19:27:24,683 INFO L78 Accepts]: Start accepts. Automaton has 13718 states and 19433 transitions. Word has length 75 [2025-03-16 19:27:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 13718 states and 19433 transitions. [2025-03-16 19:27:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 13718 states and 19433 transitions. [2025-03-16 19:27:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:24,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:24,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:27:24,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1317244102, now seen corresponding path program 1 times [2025-03-16 19:27:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788072863] [2025-03-16 19:27:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:24,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:24,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788072863] [2025-03-16 19:27:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788072863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:24,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:27:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991729534] [2025-03-16 19:27:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:27:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:25,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:27:25,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:27:25,000 INFO L87 Difference]: Start difference. First operand 13718 states and 19433 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 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:27:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:26,503 INFO L93 Difference]: Finished difference Result 41569 states and 58785 transitions. [2025-03-16 19:27:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:27:26,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 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:27:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:26,549 INFO L225 Difference]: With dead ends: 41569 [2025-03-16 19:27:26,549 INFO L226 Difference]: Without dead ends: 41352 [2025-03-16 19:27:26,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:27:26,565 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 9073 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9073 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:26,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9073 Valid, 3177 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41352 states. [2025-03-16 19:27:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41352 to 13723. [2025-03-16 19:27:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13723 states, 13721 states have (on average 1.4166605932512208) internal successors, (19438), 13722 states have internal predecessors, (19438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13723 states to 13723 states and 19438 transitions. [2025-03-16 19:27:26,902 INFO L78 Accepts]: Start accepts. Automaton has 13723 states and 19438 transitions. Word has length 75 [2025-03-16 19:27:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:26,902 INFO L471 AbstractCegarLoop]: Abstraction has 13723 states and 19438 transitions. [2025-03-16 19:27:26,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 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:27:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13723 states and 19438 transitions. [2025-03-16 19:27:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:26,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:26,905 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:27:26,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:27:26,905 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1918441684, now seen corresponding path program 1 times [2025-03-16 19:27:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789038933] [2025-03-16 19:27:26,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:26,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:26,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:26,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:26,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:27,116 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:27:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789038933] [2025-03-16 19:27:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789038933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285371070] [2025-03-16 19:27:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:27,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:27,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:27,118 INFO L87 Difference]: Start difference. First operand 13723 states and 19438 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:28,082 INFO L93 Difference]: Finished difference Result 17661 states and 24855 transitions. [2025-03-16 19:27:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:28,101 INFO L225 Difference]: With dead ends: 17661 [2025-03-16 19:27:28,102 INFO L226 Difference]: Without dead ends: 17425 [2025-03-16 19:27:28,108 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:27:28,108 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 4184 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:28,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 2826 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:27:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17425 states. [2025-03-16 19:27:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17425 to 13723. [2025-03-16 19:27:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13723 states, 13721 states have (on average 1.4165877122658699) internal successors, (19437), 13722 states have internal predecessors, (19437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13723 states to 13723 states and 19437 transitions. [2025-03-16 19:27:28,307 INFO L78 Accepts]: Start accepts. Automaton has 13723 states and 19437 transitions. Word has length 75 [2025-03-16 19:27:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:28,307 INFO L471 AbstractCegarLoop]: Abstraction has 13723 states and 19437 transitions. [2025-03-16 19:27:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13723 states and 19437 transitions. [2025-03-16 19:27:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:28,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:28,311 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:27:28,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:27:28,311 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:28,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1447157231, now seen corresponding path program 1 times [2025-03-16 19:27:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352987745] [2025-03-16 19:27:28,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:28,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:28,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:28,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:28,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:28,494 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:27:28,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:28,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352987745] [2025-03-16 19:27:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352987745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:28,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152214346] [2025-03-16 19:27:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:28,495 INFO L87 Difference]: Start difference. First operand 13723 states and 19437 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:29,391 INFO L93 Difference]: Finished difference Result 17606 states and 24799 transitions. [2025-03-16 19:27:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:29,409 INFO L225 Difference]: With dead ends: 17606 [2025-03-16 19:27:29,410 INFO L226 Difference]: Without dead ends: 17392 [2025-03-16 19:27:29,415 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:27:29,415 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 4300 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4300 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:29,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4300 Valid, 2757 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:27:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17392 states. [2025-03-16 19:27:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17392 to 13723. [2025-03-16 19:27:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13723 states, 13721 states have (on average 1.416514831280519) internal successors, (19436), 13722 states have internal predecessors, (19436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13723 states to 13723 states and 19436 transitions. [2025-03-16 19:27:29,559 INFO L78 Accepts]: Start accepts. Automaton has 13723 states and 19436 transitions. Word has length 75 [2025-03-16 19:27:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 13723 states and 19436 transitions. [2025-03-16 19:27:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 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:27:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 13723 states and 19436 transitions. [2025-03-16 19:27:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:29,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:27:29,561 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2048238547, now seen corresponding path program 1 times [2025-03-16 19:27:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862857425] [2025-03-16 19:27:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:29,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:29,606 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:27:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862857425] [2025-03-16 19:27:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862857425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872872603] [2025-03-16 19:27:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:29,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:29,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:29,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:29,607 INFO L87 Difference]: Start difference. First operand 13723 states and 19436 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:27:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:29,689 INFO L93 Difference]: Finished difference Result 32545 states and 46687 transitions. [2025-03-16 19:27:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:29,690 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:27:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:29,710 INFO L225 Difference]: With dead ends: 32545 [2025-03-16 19:27:29,710 INFO L226 Difference]: Without dead ends: 20196 [2025-03-16 19:27:29,721 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:27:29,722 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 697 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:29,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1702 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20196 states. [2025-03-16 19:27:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20196 to 16219. [2025-03-16 19:27:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16219 states, 16217 states have (on average 1.408275266695443) internal successors, (22838), 16218 states have internal predecessors, (22838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16219 states to 16219 states and 22838 transitions. [2025-03-16 19:27:29,877 INFO L78 Accepts]: Start accepts. Automaton has 16219 states and 22838 transitions. Word has length 76 [2025-03-16 19:27:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:29,877 INFO L471 AbstractCegarLoop]: Abstraction has 16219 states and 22838 transitions. [2025-03-16 19:27:29,877 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:27:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16219 states and 22838 transitions. [2025-03-16 19:27:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:29,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:29,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:27:29,879 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1081769498, now seen corresponding path program 1 times [2025-03-16 19:27:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114532405] [2025-03-16 19:27:29,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:29,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:29,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114532405] [2025-03-16 19:27:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114532405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734292149] [2025-03-16 19:27:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:30,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:30,029 INFO L87 Difference]: Start difference. First operand 16219 states and 22838 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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:27:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:30,939 INFO L93 Difference]: Finished difference Result 20695 states and 28952 transitions. [2025-03-16 19:27:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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:27:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:30,960 INFO L225 Difference]: With dead ends: 20695 [2025-03-16 19:27:30,960 INFO L226 Difference]: Without dead ends: 20621 [2025-03-16 19:27:30,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:27:30,968 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 4243 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4243 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:30,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4243 Valid, 2700 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20621 states. [2025-03-16 19:27:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20621 to 16214. [2025-03-16 19:27:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16214 states, 16212 states have (on average 1.4083395016037503) internal successors, (22832), 16213 states have internal predecessors, (22832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16214 states to 16214 states and 22832 transitions. [2025-03-16 19:27:31,134 INFO L78 Accepts]: Start accepts. Automaton has 16214 states and 22832 transitions. Word has length 76 [2025-03-16 19:27:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 16214 states and 22832 transitions. [2025-03-16 19:27:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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:27:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16214 states and 22832 transitions. [2025-03-16 19:27:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:27:31,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:31,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:27:31,137 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1315331477, now seen corresponding path program 1 times [2025-03-16 19:27:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816832648] [2025-03-16 19:27:31,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:31,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:27:31,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:27:31,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:31,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:31,478 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:27:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:31,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816832648] [2025-03-16 19:27:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816832648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:31,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701766295] [2025-03-16 19:27:31,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:31,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:31,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:31,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:31,480 INFO L87 Difference]: Start difference. First operand 16214 states and 22832 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 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:27:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:32,189 INFO L93 Difference]: Finished difference Result 27667 states and 39026 transitions. [2025-03-16 19:27:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 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:27:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:32,211 INFO L225 Difference]: With dead ends: 27667 [2025-03-16 19:27:32,211 INFO L226 Difference]: Without dead ends: 27598 [2025-03-16 19:27:32,215 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:27:32,215 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 6645 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6645 SdHoareTripleChecker+Valid, 5764 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:32,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6645 Valid, 5764 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:27:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27598 states. [2025-03-16 19:27:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27598 to 16213. [2025-03-16 19:27:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16213 states, 16211 states have (on average 1.408303004132996) internal successors, (22830), 16212 states have internal predecessors, (22830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16213 states to 16213 states and 22830 transitions. [2025-03-16 19:27:32,393 INFO L78 Accepts]: Start accepts. Automaton has 16213 states and 22830 transitions. Word has length 77 [2025-03-16 19:27:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:32,394 INFO L471 AbstractCegarLoop]: Abstraction has 16213 states and 22830 transitions. [2025-03-16 19:27:32,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 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:27:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16213 states and 22830 transitions. [2025-03-16 19:27:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:32,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:32,396 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:27:32,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:27:32,396 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:32,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash -768747778, now seen corresponding path program 1 times [2025-03-16 19:27:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:32,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108287514] [2025-03-16 19:27:32,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:32,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:32,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:32,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:32,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:32,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:33,356 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:27:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108287514] [2025-03-16 19:27:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108287514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:33,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-16 19:27:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222284617] [2025-03-16 19:27:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:33,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:27:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:33,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:27:33,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:27:33,358 INFO L87 Difference]: Start difference. First operand 16213 states and 22830 transitions. Second operand has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 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:27:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:36,960 INFO L93 Difference]: Finished difference Result 29723 states and 41687 transitions. [2025-03-16 19:27:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 19:27:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 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:27:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:36,992 INFO L225 Difference]: With dead ends: 29723 [2025-03-16 19:27:36,992 INFO L226 Difference]: Without dead ends: 29651 [2025-03-16 19:27:37,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=1813, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 19:27:37,002 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 10525 mSDsluCounter, 18225 mSDsCounter, 0 mSdLazyCounter, 7116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10525 SdHoareTripleChecker+Valid, 19401 SdHoareTripleChecker+Invalid, 7121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:37,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10525 Valid, 19401 Invalid, 7121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7116 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 19:27:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29651 states. [2025-03-16 19:27:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29651 to 16230. [2025-03-16 19:27:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16230 states, 16228 states have (on average 1.408121764850875) internal successors, (22851), 16229 states have internal predecessors, (22851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16230 states to 16230 states and 22851 transitions. [2025-03-16 19:27:37,309 INFO L78 Accepts]: Start accepts. Automaton has 16230 states and 22851 transitions. Word has length 78 [2025-03-16 19:27:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:37,309 INFO L471 AbstractCegarLoop]: Abstraction has 16230 states and 22851 transitions. [2025-03-16 19:27:37,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 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:27:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16230 states and 22851 transitions. [2025-03-16 19:27:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:37,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:37,311 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:27:37,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:27:37,311 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -743999916, now seen corresponding path program 1 times [2025-03-16 19:27:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217434973] [2025-03-16 19:27:37,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:37,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:37,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:37,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:37,690 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:27:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217434973] [2025-03-16 19:27:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217434973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:37,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188154829] [2025-03-16 19:27:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:37,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:37,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:37,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:37,691 INFO L87 Difference]: Start difference. First operand 16230 states and 22851 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:38,491 INFO L93 Difference]: Finished difference Result 20434 states and 28735 transitions. [2025-03-16 19:27:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:27:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:38,511 INFO L225 Difference]: With dead ends: 20434 [2025-03-16 19:27:38,511 INFO L226 Difference]: Without dead ends: 20327 [2025-03-16 19:27:38,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:38,519 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 5800 mSDsluCounter, 6685 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5800 SdHoareTripleChecker+Valid, 7725 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:38,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5800 Valid, 7725 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2025-03-16 19:27:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 16184. [2025-03-16 19:27:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16184 states, 16182 states have (on average 1.4085403534791745) internal successors, (22793), 16183 states have internal predecessors, (22793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16184 states to 16184 states and 22793 transitions. [2025-03-16 19:27:38,681 INFO L78 Accepts]: Start accepts. Automaton has 16184 states and 22793 transitions. Word has length 78 [2025-03-16 19:27:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:38,681 INFO L471 AbstractCegarLoop]: Abstraction has 16184 states and 22793 transitions. [2025-03-16 19:27:38,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 16184 states and 22793 transitions. [2025-03-16 19:27:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:38,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:38,683 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:27:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:27:38,683 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash -70722794, now seen corresponding path program 1 times [2025-03-16 19:27:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441979647] [2025-03-16 19:27:38,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:38,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:38,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441979647] [2025-03-16 19:27:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441979647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:39,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:39,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501184990] [2025-03-16 19:27:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:39,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:39,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:39,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:39,119 INFO L87 Difference]: Start difference. First operand 16184 states and 22793 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:39,874 INFO L93 Difference]: Finished difference Result 20395 states and 28685 transitions. [2025-03-16 19:27:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:39,891 INFO L225 Difference]: With dead ends: 20395 [2025-03-16 19:27:39,891 INFO L226 Difference]: Without dead ends: 20296 [2025-03-16 19:27:39,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:27:39,897 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 4672 mSDsluCounter, 5871 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 6872 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:39,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 6872 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:27:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20296 states. [2025-03-16 19:27:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20296 to 16153. [2025-03-16 19:27:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16153 states, 16152 states have (on average 1.4086181277860328) internal successors, (22752), 16152 states have internal predecessors, (22752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 22752 transitions. [2025-03-16 19:27:40,045 INFO L78 Accepts]: Start accepts. Automaton has 16153 states and 22752 transitions. Word has length 78 [2025-03-16 19:27:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:40,045 INFO L471 AbstractCegarLoop]: Abstraction has 16153 states and 22752 transitions. [2025-03-16 19:27:40,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 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:27:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 16153 states and 22752 transitions. [2025-03-16 19:27:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:40,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:40,047 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:27:40,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:27:40,047 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:40,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1706268698, now seen corresponding path program 1 times [2025-03-16 19:27:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:40,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326222417] [2025-03-16 19:27:40,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:40,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:40,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:40,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:40,973 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:27:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326222417] [2025-03-16 19:27:40,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326222417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:40,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:40,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-16 19:27:40,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861496047] [2025-03-16 19:27:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:40,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:27:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:40,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:27:40,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:27:40,974 INFO L87 Difference]: Start difference. First operand 16153 states and 22752 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 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:27:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:44,360 INFO L93 Difference]: Finished difference Result 29583 states and 41516 transitions. [2025-03-16 19:27:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:27:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 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:27:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:44,389 INFO L225 Difference]: With dead ends: 29583 [2025-03-16 19:27:44,389 INFO L226 Difference]: Without dead ends: 29514 [2025-03-16 19:27:44,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=1870, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 19:27:44,398 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 11156 mSDsluCounter, 16392 mSDsCounter, 0 mSdLazyCounter, 6296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11156 SdHoareTripleChecker+Valid, 17402 SdHoareTripleChecker+Invalid, 6302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:44,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11156 Valid, 17402 Invalid, 6302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6296 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 19:27:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29514 states. [2025-03-16 19:27:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29514 to 16167. [2025-03-16 19:27:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16167 states, 16166 states have (on average 1.4084498329828035) internal successors, (22769), 16166 states have internal predecessors, (22769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16167 states to 16167 states and 22769 transitions. [2025-03-16 19:27:44,669 INFO L78 Accepts]: Start accepts. Automaton has 16167 states and 22769 transitions. Word has length 78 [2025-03-16 19:27:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:44,669 INFO L471 AbstractCegarLoop]: Abstraction has 16167 states and 22769 transitions. [2025-03-16 19:27:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 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:27:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 16167 states and 22769 transitions. [2025-03-16 19:27:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:44,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:44,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:44,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:27:44,672 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:44,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1867054078, now seen corresponding path program 1 times [2025-03-16 19:27:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497802739] [2025-03-16 19:27:44,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:44,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:44,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:44,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:45,061 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:27:45,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497802739] [2025-03-16 19:27:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497802739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:45,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:45,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398111253] [2025-03-16 19:27:45,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:45,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:45,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:45,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:45,062 INFO L87 Difference]: Start difference. First operand 16167 states and 22769 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 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:27:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:45,663 INFO L93 Difference]: Finished difference Result 27547 states and 38869 transitions. [2025-03-16 19:27:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 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:27:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:45,692 INFO L225 Difference]: With dead ends: 27547 [2025-03-16 19:27:45,692 INFO L226 Difference]: Without dead ends: 27429 [2025-03-16 19:27:45,701 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:27:45,701 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 4829 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4829 SdHoareTripleChecker+Valid, 5817 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:45,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4829 Valid, 5817 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2025-03-16 19:27:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 16117. [2025-03-16 19:27:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16117 states, 16116 states have (on average 1.4089724497393894) internal successors, (22707), 16116 states have internal predecessors, (22707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 22707 transitions. [2025-03-16 19:27:45,877 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 22707 transitions. Word has length 78 [2025-03-16 19:27:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:45,877 INFO L471 AbstractCegarLoop]: Abstraction has 16117 states and 22707 transitions. [2025-03-16 19:27:45,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 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:27:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 22707 transitions. [2025-03-16 19:27:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:45,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:45,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:27:45,879 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:45,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 164083946, now seen corresponding path program 1 times [2025-03-16 19:27:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082625003] [2025-03-16 19:27:45,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:45,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:45,950 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:27:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082625003] [2025-03-16 19:27:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082625003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373924841] [2025-03-16 19:27:45,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:45,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:45,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:45,952 INFO L87 Difference]: Start difference. First operand 16117 states and 22707 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) 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:27:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:46,128 INFO L93 Difference]: Finished difference Result 62019 states and 88092 transitions. [2025-03-16 19:27:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:46,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) 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:27:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:46,176 INFO L225 Difference]: With dead ends: 62019 [2025-03-16 19:27:46,176 INFO L226 Difference]: Without dead ends: 47041 [2025-03-16 19:27:46,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:46,196 INFO L435 NwaCegarLoop]: 1024 mSDtfsCounter, 3823 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3823 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:46,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3823 Valid, 2086 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47041 states. [2025-03-16 19:27:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47041 to 30277. [2025-03-16 19:27:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30277 states, 30276 states have (on average 1.4013409961685823) internal successors, (42427), 30276 states have internal predecessors, (42427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30277 states to 30277 states and 42427 transitions. [2025-03-16 19:27:46,598 INFO L78 Accepts]: Start accepts. Automaton has 30277 states and 42427 transitions. Word has length 79 [2025-03-16 19:27:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:46,598 INFO L471 AbstractCegarLoop]: Abstraction has 30277 states and 42427 transitions. [2025-03-16 19:27:46,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) 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:27:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30277 states and 42427 transitions. [2025-03-16 19:27:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:27:46,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:46,601 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:27:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:27:46,601 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:46,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash 778440008, now seen corresponding path program 1 times [2025-03-16 19:27:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622881531] [2025-03-16 19:27:46,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:46,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:27:46,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:27:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:46,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:46,681 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:27:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622881531] [2025-03-16 19:27:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622881531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216009740] [2025-03-16 19:27:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:46,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:46,682 INFO L87 Difference]: Start difference. First operand 30277 states and 42427 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:27:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:46,853 INFO L93 Difference]: Finished difference Result 51165 states and 71731 transitions. [2025-03-16 19:27:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:27:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:46,875 INFO L225 Difference]: With dead ends: 51165 [2025-03-16 19:27:46,876 INFO L226 Difference]: Without dead ends: 22002 [2025-03-16 19:27:46,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:46,897 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 1915 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1915 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:46,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1915 Valid, 1701 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22002 states. [2025-03-16 19:27:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22002 to 21996. [2025-03-16 19:27:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21996 states, 21995 states have (on average 1.3885428506478745) internal successors, (30541), 21995 states have internal predecessors, (30541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21996 states to 21996 states and 30541 transitions. [2025-03-16 19:27:47,110 INFO L78 Accepts]: Start accepts. Automaton has 21996 states and 30541 transitions. Word has length 80 [2025-03-16 19:27:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:47,110 INFO L471 AbstractCegarLoop]: Abstraction has 21996 states and 30541 transitions. [2025-03-16 19:27:47,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:27:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21996 states and 30541 transitions. [2025-03-16 19:27:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:27:47,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:47,114 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:27:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:27:47,114 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -88875531, now seen corresponding path program 1 times [2025-03-16 19:27:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059484274] [2025-03-16 19:27:47,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:47,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:47,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:47,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:47,179 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:27:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:47,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059484274] [2025-03-16 19:27:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059484274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:47,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:47,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197544215] [2025-03-16 19:27:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:47,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:47,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:47,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:47,180 INFO L87 Difference]: Start difference. First operand 21996 states and 30541 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:47,316 INFO L93 Difference]: Finished difference Result 62306 states and 86787 transitions. [2025-03-16 19:27:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:47,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:27:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:47,359 INFO L225 Difference]: With dead ends: 62306 [2025-03-16 19:27:47,359 INFO L226 Difference]: Without dead ends: 41424 [2025-03-16 19:27:47,382 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:27:47,383 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 526 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:47,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1514 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41424 states. [2025-03-16 19:27:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41424 to 39470. [2025-03-16 19:27:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39470 states, 39469 states have (on average 1.3817679697990828) internal successors, (54537), 39469 states have internal predecessors, (54537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39470 states to 39470 states and 54537 transitions. [2025-03-16 19:27:47,860 INFO L78 Accepts]: Start accepts. Automaton has 39470 states and 54537 transitions. Word has length 82 [2025-03-16 19:27:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:47,861 INFO L471 AbstractCegarLoop]: Abstraction has 39470 states and 54537 transitions. [2025-03-16 19:27:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 39470 states and 54537 transitions. [2025-03-16 19:27:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:27:47,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:47,864 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:27:47,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:27:47,865 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:47,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1978560205, now seen corresponding path program 1 times [2025-03-16 19:27:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:47,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847484907] [2025-03-16 19:27:47,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:47,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:27:47,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:27:47,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:47,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847484907] [2025-03-16 19:27:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847484907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:47,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:47,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:47,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132109209] [2025-03-16 19:27:47,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:47,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:47,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:47,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:47,929 INFO L87 Difference]: Start difference. First operand 39470 states and 54537 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:48,173 INFO L93 Difference]: Finished difference Result 113274 states and 156419 transitions. [2025-03-16 19:27:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:27:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:48,259 INFO L225 Difference]: With dead ends: 113274 [2025-03-16 19:27:48,259 INFO L226 Difference]: Without dead ends: 74918 [2025-03-16 19:27:48,300 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:27:48,301 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 404 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:48,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1595 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74918 states. [2025-03-16 19:27:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74918 to 71012. [2025-03-16 19:27:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71012 states, 71011 states have (on average 1.369154074720818) internal successors, (97225), 71011 states have internal predecessors, (97225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 97225 transitions. [2025-03-16 19:27:49,329 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 97225 transitions. Word has length 85 [2025-03-16 19:27:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:49,329 INFO L471 AbstractCegarLoop]: Abstraction has 71012 states and 97225 transitions. [2025-03-16 19:27:49,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 97225 transitions. [2025-03-16 19:27:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:27:49,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:49,335 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:27:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:27:49,336 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -241221355, now seen corresponding path program 1 times [2025-03-16 19:27:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471570661] [2025-03-16 19:27:49,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:49,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:27:49,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:27:49,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:49,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:49,481 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:27:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471570661] [2025-03-16 19:27:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471570661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061674991] [2025-03-16 19:27:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:49,482 INFO L87 Difference]: Start difference. First operand 71012 states and 97225 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:27:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:49,661 INFO L93 Difference]: Finished difference Result 75214 states and 102826 transitions. [2025-03-16 19:27:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:49,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:27:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:49,746 INFO L225 Difference]: With dead ends: 75214 [2025-03-16 19:27:49,747 INFO L226 Difference]: Without dead ends: 75212 [2025-03-16 19:27:49,772 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:27:49,772 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 3825 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:49,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4804 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75212 states. [2025-03-16 19:27:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75212 to 75212. [2025-03-16 19:27:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75212 states, 75211 states have (on average 1.3485394423688024) internal successors, (101425), 75211 states have internal predecessors, (101425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75212 states to 75212 states and 101425 transitions. [2025-03-16 19:27:50,607 INFO L78 Accepts]: Start accepts. Automaton has 75212 states and 101425 transitions. Word has length 86 [2025-03-16 19:27:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 75212 states and 101425 transitions. [2025-03-16 19:27:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:27:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75212 states and 101425 transitions. [2025-03-16 19:27:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:27:50,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:50,611 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:27:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:27:50,611 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1217088253, now seen corresponding path program 1 times [2025-03-16 19:27:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202610881] [2025-03-16 19:27:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:50,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:27:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:27:50,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:50,669 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:27:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202610881] [2025-03-16 19:27:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202610881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:50,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234741192] [2025-03-16 19:27:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:50,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:50,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:50,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:50,671 INFO L87 Difference]: Start difference. First operand 75212 states and 101425 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:27:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:51,298 INFO L93 Difference]: Finished difference Result 211996 states and 285375 transitions. [2025-03-16 19:27:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:51,299 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:27:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:51,489 INFO L225 Difference]: With dead ends: 211996 [2025-03-16 19:27:51,490 INFO L226 Difference]: Without dead ends: 137898 [2025-03-16 19:27:51,565 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:27:51,566 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 479 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:51,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1496 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137898 states. [2025-03-16 19:27:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137898 to 137896. [2025-03-16 19:27:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137896 states, 137895 states have (on average 1.332818448819754) internal successors, (183789), 137895 states have internal predecessors, (183789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137896 states to 137896 states and 183789 transitions. [2025-03-16 19:27:53,551 INFO L78 Accepts]: Start accepts. Automaton has 137896 states and 183789 transitions. Word has length 87 [2025-03-16 19:27:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:53,551 INFO L471 AbstractCegarLoop]: Abstraction has 137896 states and 183789 transitions. [2025-03-16 19:27:53,551 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:27:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 137896 states and 183789 transitions. [2025-03-16 19:27:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:27:53,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:53,555 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:27:53,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:27:53,555 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1455936991, now seen corresponding path program 1 times [2025-03-16 19:27:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585890521] [2025-03-16 19:27:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:53,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:27:53,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:27:53,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:53,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:53,643 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:27:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585890521] [2025-03-16 19:27:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585890521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:53,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97439966] [2025-03-16 19:27:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:53,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:53,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:53,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:53,645 INFO L87 Difference]: Start difference. First operand 137896 states and 183789 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:54,745 INFO L93 Difference]: Finished difference Result 272770 states and 364426 transitions. [2025-03-16 19:27:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:27:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:55,068 INFO L225 Difference]: With dead ends: 272770 [2025-03-16 19:27:55,069 INFO L226 Difference]: Without dead ends: 231824 [2025-03-16 19:27:55,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:55,126 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 3015 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3015 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:55,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3015 Valid, 2558 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231824 states. [2025-03-16 19:27:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231824 to 174718. [2025-03-16 19:27:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174718 states, 174717 states have (on average 1.3299163790587063) internal successors, (232359), 174717 states have internal predecessors, (232359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174718 states to 174718 states and 232359 transitions. [2025-03-16 19:27:57,581 INFO L78 Accepts]: Start accepts. Automaton has 174718 states and 232359 transitions. Word has length 89 [2025-03-16 19:27:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 174718 states and 232359 transitions. [2025-03-16 19:27:57,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 174718 states and 232359 transitions. [2025-03-16 19:27:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:27:57,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:57,588 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] [2025-03-16 19:27:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:27:57,588 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2036325657, now seen corresponding path program 1 times [2025-03-16 19:27:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106890646] [2025-03-16 19:27:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:57,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:27:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:27:57,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:57,653 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:27:57,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106890646] [2025-03-16 19:27:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106890646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:57,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990995350] [2025-03-16 19:27:57,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:57,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:57,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:57,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:57,654 INFO L87 Difference]: Start difference. First operand 174718 states and 232359 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:58,475 INFO L93 Difference]: Finished difference Result 213926 states and 283793 transitions. [2025-03-16 19:27:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 19:27:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:58,651 INFO L225 Difference]: With dead ends: 213926 [2025-03-16 19:27:58,652 INFO L226 Difference]: Without dead ends: 135516 [2025-03-16 19:27:58,722 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:27:58,723 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 375 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:58,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1678 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135516 states.