./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.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 ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:17:53,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:17:53,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:17:53,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:17:53,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:17:53,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:17:53,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:17:53,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:17:53,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:17:53,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:17:53,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:17:53,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:17:53,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:17:53,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:17:53,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:17:53,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:53,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:17:53,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:17:53,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:17:53,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:17:53,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:17:53,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:17:53,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:17:53,751 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 -> ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a [2025-03-03 15:17:53,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:17:53,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:17:53,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:17:53,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:17:53,968 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:17:53,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:17:55,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d064b2/cb8b417cbc9c48f4af98c23b26045644/FLAGbd3157470 [2025-03-03 15:17:55,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:17:55,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:17:55,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d064b2/cb8b417cbc9c48f4af98c23b26045644/FLAGbd3157470 [2025-03-03 15:17:56,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d064b2/cb8b417cbc9c48f4af98c23b26045644 [2025-03-03 15:17:56,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:17:56,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:17:56,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:56,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:17:56,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:17:56,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:56" (1/1) ... [2025-03-03 15:17:56,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a53493f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:56, skipping insertion in model container [2025-03-03 15:17:56,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:56" (1/1) ... [2025-03-03 15:17:56,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:17:57,011 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-03 15:17:57,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-03 15:17:57,170 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-03 15:17:57,196 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-03 15:17:57,209 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-03 15:17:57,216 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-03 15:17:57,223 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-03 15:17:57,338 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-03 15:17:57,383 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-03 15:17:57,409 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-03 15:17:57,422 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-03 15:17:57,429 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-03 15:17:57,435 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-03 15:17:57,480 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-03 15:17:57,504 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-03 15:17:57,518 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-03 15:17:57,524 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-03 15:17:57,531 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-03 15:17:57,558 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-03 15:17:57,571 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-03 15:17:57,578 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-03 15:17:57,585 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-03 15:17:57,592 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-03 15:17:57,620 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-03 15:17:57,626 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-03 15:17:57,632 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-03 15:17:57,639 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-03 15:17:57,645 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-03 15:17:57,652 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-03 15:17:57,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:57,717 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:17:58,040 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-03 15:17:58,156 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-03 15:17:58,197 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-03 15:17:58,219 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-03 15:17:58,231 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-03 15:17:58,237 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-03 15:17:58,244 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-03 15:17:58,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-03 15:17:58,382 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-03 15:17:58,402 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-03 15:17:58,414 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-03 15:17:58,421 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-03 15:17:58,427 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-03 15:17:58,472 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-03 15:17:58,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-03 15:17:58,506 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-03 15:17:58,513 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-03 15:17:58,519 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-03 15:17:58,544 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-03 15:17:58,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-03 15:17:58,562 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-03 15:17:58,567 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-03 15:17:58,573 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-03 15:17:58,579 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-03 15:17:58,584 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-03 15:17:58,591 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-03 15:17:58,598 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-03 15:17:58,604 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-03 15:17:58,611 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.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-03 15:17:58,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:58,680 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:17:58,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58 WrapperNode [2025-03-03 15:17:58,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:58,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:58,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:17:58,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:17:58,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:58,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,082 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25985 [2025-03-03 15:17:59,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:59,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:17:59,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:17:59,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:17:59,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:17:59,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:17:59,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:17:59,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:17:59,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:17:59,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (1/1) ... [2025-03-03 15:17:59,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:59,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:17:59,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:17:59,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:17:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:17:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:17:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:17:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:17:59,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:17:59,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:18:07,836 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L39085: havoc main_~check__tmp~162#1;havoc main_~node7__m7~168#1;havoc main_~node6__m6~141#1;havoc main_~node5__m5~127#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~116#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~113#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~161#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44370: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34858: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~149#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8961: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~30#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17419: havoc main_~node7__m7~72#1;havoc main_~node6__m6~61#1;havoc main_~node5__m5~55#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22708: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~95#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8441: havoc main_~node7__m7~33#1;havoc main_~node6__m6~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L37511: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~135#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42799: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1;havoc main_~node7__m7~184#1;havoc main_~node6__m6~154#1;havoc main_~node5__m5~139#1;havoc main_~node4__m4~131#1;havoc main_~node3__m3~127#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~124#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-03 15:18:07,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26946: havoc main_~node7__m7~114#1;havoc main_~node6__m6~96#1;havoc main_~node5__m5~86#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~100#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~node7__m7~1#1;havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8978: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~35#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38046: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~156#1;havoc main_~node7__m7~163#1;havoc main_~node6__m6~137#1;havoc main_~node5__m5~123#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~110#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~155#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30648: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~118#1;havoc main_~node7__m7~130#1;havoc main_~node6__m6~109#1;havoc main_~node5__m5~98#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~88#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~117#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15855: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~55#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7400: havoc main_~node7__m7~28#1;havoc main_~node6__m6~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42283: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~182#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44398: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:18:07,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-03 15:18:07,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34356: havoc main_~node7__m7~147#1;havoc main_~node6__m6~123#1;havoc main_~node5__m5~111#1;havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~99#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~136#1; [2025-03-03 15:18:07,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L37528: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~161#1; [2025-03-03 15:18:07,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30130: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~128#1; [2025-03-03 15:18:07,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16390: havoc main_~check__tmp~54#1;havoc main_~node7__m7~67#1;havoc main_~node6__m6~57#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5298: havoc main_~node7__m7~19#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~15#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21154: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~77#1;havoc main_~node7__m7~88#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~63#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~76#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15872: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~65#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33319: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~133#1;havoc main_~node7__m7~142#1;havoc main_~node6__m6~119#1;havoc main_~node5__m5~107#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~96#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~132#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node7__m7~10#1;havoc main_~node6__m6~9#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20636: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~86#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15355: havoc main_~node7__m7~63#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44426: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4787: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~15#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6902: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~26#1; [2025-03-03 15:18:07,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32803: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~140#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6378: havoc main_~node7__m7~24#1;havoc main_~node6__m6~21#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~33#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29642: havoc main_~node7__m7~126#1;havoc main_~node6__m6~106#1;havoc main_~node5__m5~95#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~85#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~112#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4804: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~17#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25945: havoc main_~node7__m7~109#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~83#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~74#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~96#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25418: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~81#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20134: havoc main_~node7__m7~84#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~71#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L37046: havoc main_~check__tmp~150#1;havoc main_~node7__m7~159#1;havoc main_~node6__m6~133#1;havoc main_~node5__m5~120#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~107#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~149#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4282: havoc main_~node7__m7~15#1;havoc main_~node6__m6~13#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14324: havoc main_~check__tmp~46#1;havoc main_~node7__m7~58#1;havoc main_~node6__m6~49#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~45#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2697: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~8#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~node7__m7~6#1;havoc main_~node6__m6~6#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44455: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11687: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~34#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13806: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~56#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41818: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1;havoc main_~node7__m7~180#1;havoc main_~node6__m6~151#1;havoc main_~node5__m5~136#1;havoc main_~node4__m4~128#1;havoc main_~node3__m3~124#1;havoc main_~node2__m2~122#1;havoc main_~node1__m1~121#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25435: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~90#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11704: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~36#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25452: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~107#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13298: havoc main_~node7__m7~54#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~42#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28097: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~85#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36027: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~145#1;havoc main_~node7__m7~154#1;havoc main_~node6__m6~129#1;havoc main_~node5__m5~116#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~105#1;havoc main_~node1__m1~104#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~144#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24930: havoc main_~node7__m7~105#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~72#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~92#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40259: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~145#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11721: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18595: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~65#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11196: havoc main_~check__tmp~35#1;havoc main_~node7__m7~45#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12253: havoc main_~node7__m7~49#1;havoc main_~node6__m6~42#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~39#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40794: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1;havoc main_~node7__m7~175#1;havoc main_~node6__m6~147#1;havoc main_~node5__m5~132#1;havoc main_~node4__m4~125#1;havoc main_~node3__m3~121#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~118#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L35509: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~152#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32341: havoc main_~check__tmp~127#1;havoc main_~node7__m7~138#1;havoc main_~node6__m6~116#1;havoc main_~node5__m5~104#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~95#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~93#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~126#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28641: havoc main_~node7__m7~121#1;havoc main_~node6__m6~102#1;havoc main_~node5__m5~92#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~83#1;havoc main_~node1__m1~82#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~108#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28114: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~90#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19130: havoc main_~check__tmp~66#1;havoc main_~node7__m7~79#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~60#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40276: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~173#1; [2025-03-03 15:18:07,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11738: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~47#1; [2025-03-03 15:18:07,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18612: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~77#1; [2025-03-03 15:18:07,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38698: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~160#1;havoc main_~node7__m7~166#1;havoc main_~node6__m6~139#1;havoc main_~node5__m5~125#1;havoc main_~node4__m4~118#1;havoc main_~node3__m3~115#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~112#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~159#1; [2025-03-03 15:18:07,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28131: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~100#1; [2025-03-03 15:18:07,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42930: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~155#1; [2025-03-03 15:18:07,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L43464: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1;havoc main_~node7__m7~187#1;havoc main_~node6__m6~157#1;havoc main_~node5__m5~141#1;havoc main_~node4__m4~133#1;havoc main_~node3__m3~129#1;havoc main_~node2__m2~127#1;havoc main_~node1__m1~126#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-03 15:18:07,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18095: havoc main_~node7__m7~75#1;havoc main_~node6__m6~63#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-03 15:18:07,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38182: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~164#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10172: havoc main_~check__tmp~30#1;havoc main_~node7__m7~40#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~29#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30790: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~99#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23919: havoc main_~node7__m7~100#1;havoc main_~node6__m6~84#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~70#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~89#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28148: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~119#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42947: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~185#1; [2025-03-03 15:18:07,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L35021: havoc main_~node7__m7~150#1;havoc main_~node6__m6~126#1;havoc main_~node5__m5~113#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~102#1;havoc main_~node1__m1~101#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~139#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9654: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~38#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17055: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node7__m7~70#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27626: havoc main_~check__tmp~104#1;havoc main_~node7__m7~117#1;havoc main_~node6__m6~98#1;havoc main_~node5__m5~88#1;havoc main_~node4__m4~83#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~79#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~103#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31328: havoc main_~check__tmp~121#1;havoc main_~node7__m7~133#1;havoc main_~node6__m6~112#1;havoc main_~node5__m5~101#1;havoc main_~node4__m4~95#1;havoc main_~node3__m3~92#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~90#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~120#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23404: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~98#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21293: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~75#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30807: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~110#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16537: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~68#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22881: havoc main_~node7__m7~96#1;havoc main_~node6__m6~81#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~65#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~86#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L39794: havoc main_~check__tmp~166#1;havoc main_~node7__m7~171#1;havoc main_~node6__m6~143#1;havoc main_~node5__m5~129#1;havoc main_~node4__m4~122#1;havoc main_~node3__m3~118#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~115#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~165#1; [2025-03-03 15:18:07,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21828: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~81#1;havoc main_~node7__m7~91#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~80#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9146: havoc main_~node7__m7~36#1;havoc main_~node6__m6~31#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~26#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33459: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~99#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8091: havoc main_~node7__m7~31#1;havoc main_~node6__m6~27#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21310: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~89#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30824: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~131#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33476: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~102#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16035: havoc main_~node7__m7~66#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~50#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7580: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~25#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc main_~check__tmp~16#1;havoc main_~node7__m7~22#1;havoc main_~node6__m6~19#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26616: havoc main_~check__tmp~99#1;havoc main_~node7__m7~112#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~85#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~76#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~98#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34020: havoc main_~node7__m7~145#1;havoc main_~node6__m6~122#1;havoc main_~node5__m5~110#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~99#1;havoc main_~node1__m1~98#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~135#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~20#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L37720: havoc main_~check__tmp~154#1;havoc main_~node7__m7~162#1;havoc main_~node6__m6~136#1;havoc main_~node5__m5~122#1;havoc main_~node4__m4~115#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~109#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~153#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30322: havoc main_~check__tmp~116#1;havoc main_~node7__m7~129#1;havoc main_~node6__m6~108#1;havoc main_~node5__m5~97#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~87#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~115#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33493: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~108#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7597: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~29#1; [2025-03-03 15:18:07,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42481: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1;havoc main_~node7__m7~183#1;havoc main_~node6__m6~153#1;havoc main_~node5__m5~138#1;havoc main_~node4__m4~130#1;havoc main_~node3__m3~126#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~123#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7075: havoc main_~node7__m7~27#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15005: havoc main_~node7__m7~61#1;havoc main_~node6__m6~52#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3378: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~9#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14477: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~45#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33510: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~120#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4972: havoc main_~node7__m7~18#1;havoc main_~node6__m6~16#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20828: havoc main_~check__tmp~75#1;havoc main_~node7__m7~87#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~74#1; [2025-03-03 15:18:07,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26113: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~110#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: havoc main_~node7__m7~4#1;havoc main_~node6__m6~4#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41446: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1;havoc main_~node7__m7~178#1;havoc main_~node6__m6~149#1;havoc main_~node5__m5~134#1;havoc main_~node4__m4~127#1;havoc main_~node3__m3~123#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~120#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3395: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~10#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14494: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~50#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: havoc main_~node7__m7~9#1;havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3927: havoc main_~node7__m7~13#1;havoc main_~node6__m6~12#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36169: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~117#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33527: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~143#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13974: havoc main_~node7__m7~57#1;havoc main_~node6__m6~48#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~44#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33001: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~131#1;havoc main_~node7__m7~141#1;havoc main_~node6__m6~118#1;havoc main_~node5__m5~106#1;havoc main_~node4__m4~100#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~95#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~130#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40930: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~176#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36707: havoc main_~check__tmp~148#1;havoc main_~node7__m7~157#1;havoc main_~node6__m6~132#1;havoc main_~node5__m5~119#1;havoc main_~node4__m4~112#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~106#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~147#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19795: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~70#1;havoc main_~node7__m7~82#1;havoc main_~node6__m6~69#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~69#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44108: havoc main_~node1__m1~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1;havoc main_~node7__m7~190#1;havoc main_~node6__m6~159#1;havoc main_~node5__m5~143#1;havoc main_~node4__m4~135#1;havoc main_~node3__m3~131#1;havoc main_~node2__m2~129#1;havoc main_~node1__m1~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~11#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14511: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~59#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29312: havoc main_~check__tmp~111#1;havoc main_~node7__m7~124#1;havoc main_~node6__m6~104#1;havoc main_~node5__m5~94#1;havoc main_~node4__m4~89#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~84#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~110#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36186: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~130#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12933: havoc main_~node7__m7~52#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~41#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19277: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~80#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25620: havoc main_~node7__m7~108#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~82#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~95#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L43592: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~188#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38835: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~119#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36203: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~155#1; [2025-03-03 15:18:07,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28809: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~122#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38852: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~126#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18775: havoc main_~node7__m7~78#1;havoc main_~node6__m6~66#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12435: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~50#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10322: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~35#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24594: havoc main_~node7__m7~103#1;havoc main_~node6__m6~87#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~91#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31993: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~125#1;havoc main_~node7__m7~136#1;havoc main_~node6__m6~114#1;havoc main_~node5__m5~103#1;havoc main_~node4__m4~97#1;havoc main_~node3__m3~94#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~92#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~124#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22480: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~85#1;havoc main_~node7__m7~94#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~84#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11911: havoc main_~node7__m7~48#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~38#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44150: havoc main_~node2__m2~130#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10857: havoc main_~check__tmp~33#1;havoc main_~node7__m7~43#1;havoc main_~node6__m6~37#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~32#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17200: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~51#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38869: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~140#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L35701: havoc main_~check__tmp~143#1;havoc main_~node7__m7~153#1;havoc main_~node6__m6~128#1;havoc main_~node5__m5~115#1;havoc main_~node4__m4~109#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~104#1;havoc main_~node1__m1~103#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~142#1; [2025-03-03 15:18:07,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31475: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~134#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21964: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~92#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10339: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~41#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24084: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~85#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40468: havoc main_~check__tmp~170#1;havoc main_~node7__m7~174#1;havoc main_~node6__m6~146#1;havoc main_~node5__m5~131#1;havoc main_~node4__m4~124#1;havoc main_~node3__m3~120#1;havoc main_~node2__m2~118#1;havoc main_~node1__m1~117#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~169#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38886: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~167#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17745: havoc main_~node7__m7~73#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17217: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~54#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28316: havoc main_~node7__m7~120#1;havoc main_~node6__m6~101#1;havoc main_~node5__m5~91#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~81#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~107#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9822: havoc main_~node7__m7~39#1;havoc main_~node6__m6~33#1;havoc main_~node5__m5~30#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~28#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44182: havoc main_~node3__m3~132#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24101: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~101#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17234: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~60#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23577: havoc main_~node7__m7~99#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~75#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~88#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38380: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~158#1;havoc main_~node7__m7~165#1;havoc main_~node6__m6~138#1;havoc main_~node5__m5~124#1;havoc main_~node4__m4~117#1;havoc main_~node3__m3~114#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~111#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~157#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27287: havoc main_~check__tmp~102#1;havoc main_~node7__m7~115#1;havoc main_~node6__m6~97#1;havoc main_~node5__m5~87#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~78#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~101#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30987: havoc main_~node7__m7~132#1;havoc main_~node6__m6~111#1;havoc main_~node5__m5~100#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~89#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~119#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L43145: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1;havoc main_~node7__m7~186#1;havoc main_~node6__m6~156#1;havoc main_~node5__m5~140#1;havoc main_~node4__m4~132#1;havoc main_~node3__m3~128#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~125#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-03 15:18:07,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8791: havoc main_~check__tmp~25#1;havoc main_~node7__m7~34#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34691: havoc main_~check__tmp~138#1;havoc main_~node7__m7~148#1;havoc main_~node6__m6~124#1;havoc main_~node5__m5~112#1;havoc main_~node4__m4~106#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~100#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~137#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17251: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~71#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~17#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26766: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~95#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16729: havoc main_~check__tmp~56#1;havoc main_~node7__m7~69#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~55#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L39455: havoc main_~check__tmp~164#1;havoc main_~node7__m7~169#1;havoc main_~node6__m6~142#1;havoc main_~node5__m5~128#1;havoc main_~node4__m4~121#1;havoc main_~node3__m3~117#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~114#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~163#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8273: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~32#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44214: havoc main_~node4__m4~136#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41580: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~135#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26783: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~113#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21502: havoc main_~check__tmp~79#1;havoc main_~node7__m7~90#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~78#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34188: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~146#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5648: havoc main_~node7__m7~21#1;havoc main_~node6__m6~18#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7765: havoc main_~node7__m7~30#1;havoc main_~node6__m6~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41597: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~150#1; [2025-03-03 15:18:07,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6188: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~20#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L37372: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~152#1;havoc main_~node7__m7~160#1;havoc main_~node6__m6~134#1;havoc main_~node5__m5~121#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~108#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~151#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6720: havoc main_~node7__m7~25#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc main_~check__tmp~51#1;havoc main_~node7__m7~64#1;havoc main_~node6__m6~54#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4607: havoc main_~node7__m7~16#1;havoc main_~node6__m6~14#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44246: havoc main_~node5__m5~144#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19937: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~63#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26281: havoc main_~node7__m7~111#1;havoc main_~node6__m6~93#1;havoc main_~node5__m5~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~97#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29983: havoc main_~check__tmp~114#1;havoc main_~node7__m7~127#1;havoc main_~node6__m6~107#1;havoc main_~node5__m5~96#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~86#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~113#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36854: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~158#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15187: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~62#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41614: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~179#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6205: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~23#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29462: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~105#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42147: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1;havoc main_~node7__m7~181#1;havoc main_~node6__m6~152#1;havoc main_~node5__m5~137#1;havoc main_~node4__m4~129#1;havoc main_~node3__m3~125#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~122#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1983: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~5#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19954: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~70#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33695: havoc main_~node7__m7~144#1;havoc main_~node6__m6~121#1;havoc main_~node5__m5~109#1;havoc main_~node4__m4~103#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~97#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~134#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~3#1;havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: havoc main_~node7__m7~7#1;havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20489: havoc main_~check__tmp~73#1;havoc main_~node7__m7~85#1;havoc main_~node6__m6~72#1;havoc main_~node5__m5~65#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~72#1; [2025-03-03 15:18:07,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~node7__m7~60#1;havoc main_~node6__m6~51#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~14#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29479: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~125#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13624: havoc main_~node7__m7~55#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~43#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3585: havoc main_~node7__m7~12#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~5#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19971: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~83#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32132: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~115#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11522: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~37#1;havoc main_~node7__m7~46#1;havoc main_~node6__m6~39#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25265: havoc main_~check__tmp~94#1;havoc main_~node7__m7~106#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~80#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~72#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~93#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22623: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~65#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36366: havoc main_~node7__m7~156#1;havoc main_~node6__m6~131#1;havoc main_~node5__m5~118#1;havoc main_~node4__m4~111#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~105#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~146#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32667: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~129#1;havoc main_~node7__m7~139#1;havoc main_~node6__m6~117#1;havoc main_~node5__m5~105#1;havoc main_~node4__m4~99#1;havoc main_~node3__m3~96#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~94#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~128#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13113: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~45#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L41128: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1;havoc main_~node7__m7~177#1;havoc main_~node6__m6~148#1;havoc main_~node5__m5~133#1;havoc main_~node4__m4~126#1;havoc main_~node3__m3~122#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~119#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11004: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~44#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28977: havoc main_~node7__m7~123#1;havoc main_~node6__m6~103#1;havoc main_~node5__m5~93#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~83#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~109#1; [2025-03-03 15:18:07,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32149: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~137#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22640: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~66#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19469: havoc main_~check__tmp~68#1;havoc main_~node7__m7~81#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~67#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13130: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~53#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44314: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~160#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24762: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~104#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12608: havoc main_~node7__m7~51#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~35#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~40#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L43793: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1;havoc main_~node7__m7~189#1;havoc main_~node6__m6~158#1;havoc main_~node5__m5~142#1;havoc main_~node4__m4~134#1;havoc main_~node3__m3~130#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~127#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22657: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~68#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10502: havoc main_~node7__m7~42#1;havoc main_~node6__m6~36#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~31#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27952: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~106#1;havoc main_~node7__m7~118#1;havoc main_~node6__m6~99#1;havoc main_~node5__m5~89#1;havoc main_~node4__m4~84#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~80#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~105#1; [2025-03-03 15:18:07,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18445: havoc main_~check__tmp~63#1;havoc main_~node7__m7~76#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44342: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22674: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~72#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L35362: havoc main_~check__tmp~141#1;havoc main_~node7__m7~151#1;havoc main_~node6__m6~127#1;havoc main_~node5__m5~114#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~105#1;havoc main_~node2__m2~103#1;havoc main_~node1__m1~102#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~140#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27434: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~116#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40120: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~168#1;havoc main_~node7__m7~172#1;havoc main_~node6__m6~144#1;havoc main_~node5__m5~130#1;havoc main_~node4__m4~123#1;havoc main_~node3__m3~119#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~116#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~167#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31667: havoc main_~check__tmp~123#1;havoc main_~node7__m7~135#1;havoc main_~node6__m6~113#1;havoc main_~node5__m5~102#1;havoc main_~node4__m4~96#1;havoc main_~node3__m3~93#1;havoc main_~node2__m2~92#1;havoc main_~node1__m1~91#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~122#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17927: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~74#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24269: havoc main_~node7__m7~102#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~73#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~90#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9472: havoc main_~node7__m7~37#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~27#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8944: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~27#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34841: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~125#1; [2025-03-03 15:18:07,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L39602: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~170#1; [2025-03-03 15:18:07,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22162: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~83#1;havoc main_~node7__m7~93#1;havoc main_~node6__m6~78#1;havoc main_~node5__m5~70#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~82#1; [2025-03-03 15:18:07,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22691: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~80#1; [2025-03-03 15:18:07,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23223: havoc main_~node7__m7~97#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~87#1; [2025-03-03 15:18:07,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:18:08,870 INFO L? ?]: Removed 4832 outVars from TransFormulas that were not future-live. [2025-03-03 15:18:08,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:18:08,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:18:08,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:18:08,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:08 BoogieIcfgContainer [2025-03-03 15:18:08,951 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:18:08,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:18:08,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:18:08,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:18:08,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:17:56" (1/3) ... [2025-03-03 15:18:08,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d630c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:08, skipping insertion in model container [2025-03-03 15:18:08,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:58" (2/3) ... [2025-03-03 15:18:08,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d630c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:08, skipping insertion in model container [2025-03-03 15:18:08,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:08" (3/3) ... [2025-03-03 15:18:08,961 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:18:08,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:18:08,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 5023 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-03 15:18:09,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:18:09,105 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;@2bdc4489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:18:09,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-03 15:18:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 5023 states, 4993 states have (on average 1.8155417584618465) internal successors, (9065), 5022 states have internal predecessors, (9065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:09,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:09,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:09,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2145942462, now seen corresponding path program 1 times [2025-03-03 15:18:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972454429] [2025-03-03 15:18:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:09,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972454429] [2025-03-03 15:18:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972454429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936272344] [2025-03-03 15:18:09,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:09,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:09,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:09,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:09,781 INFO L87 Difference]: Start difference. First operand has 5023 states, 4993 states have (on average 1.8155417584618465) internal successors, (9065), 5022 states have internal predecessors, (9065), 0 states have call successors, (0), 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 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,438 INFO L93 Difference]: Finished difference Result 6067 states and 10810 transitions. [2025-03-03 15:18:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:18:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,460 INFO L225 Difference]: With dead ends: 6067 [2025-03-03 15:18:12,460 INFO L226 Difference]: Without dead ends: 3560 [2025-03-03 15:18:12,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:12,469 INFO L435 NwaCegarLoop]: 3236 mSDtfsCounter, 18771 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18771 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18771 Valid, 3282 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 15:18:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-03-03 15:18:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3560. [2025-03-03 15:18:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3531 states have (on average 1.334749362786746) internal successors, (4713), 3559 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4713 transitions. [2025-03-03 15:18:12,602 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4713 transitions. Word has length 101 [2025-03-03 15:18:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 3560 states and 4713 transitions. [2025-03-03 15:18:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4713 transitions. [2025-03-03 15:18:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:12,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:12,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:18:12,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 794075970, now seen corresponding path program 1 times [2025-03-03 15:18:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509707505] [2025-03-03 15:18:12,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:12,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:12,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509707505] [2025-03-03 15:18:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509707505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882033625] [2025-03-03 15:18:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:12,924 INFO L87 Difference]: Start difference. First operand 3560 states and 4713 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,264 INFO L93 Difference]: Finished difference Result 4083 states and 5368 transitions. [2025-03-03 15:18:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:18:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,271 INFO L225 Difference]: With dead ends: 4083 [2025-03-03 15:18:14,271 INFO L226 Difference]: Without dead ends: 2336 [2025-03-03 15:18:14,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:14,274 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 9223 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9223 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9223 Valid, 1406 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:18:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-03 15:18:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2025-03-03 15:18:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2307 states have (on average 1.3524057217165149) internal successors, (3120), 2335 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3120 transitions. [2025-03-03 15:18:14,305 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3120 transitions. Word has length 101 [2025-03-03 15:18:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,305 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3120 transitions. [2025-03-03 15:18:14,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3120 transitions. [2025-03-03 15:18:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:18:14,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:18:14,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:14,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1788268636, now seen corresponding path program 1 times [2025-03-03 15:18:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602319220] [2025-03-03 15:18:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:18:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:18:14,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18: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-03 15:18:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602319220] [2025-03-03 15:18:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602319220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604706681] [2025-03-03 15:18:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:14,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:14,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:14,470 INFO L87 Difference]: Start difference. First operand 2336 states and 3120 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:15,312 INFO L93 Difference]: Finished difference Result 3019 states and 4030 transitions. [2025-03-03 15:18:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:15,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:18:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:15,318 INFO L225 Difference]: With dead ends: 3019 [2025-03-03 15:18:15,318 INFO L226 Difference]: Without dead ends: 1840 [2025-03-03 15:18:15,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:15,320 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 7351 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7351 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:15,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7351 Valid, 1190 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:18:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-03 15:18:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2025-03-03 15:18:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1811 states have (on average 1.3732744340143568) internal successors, (2487), 1839 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2487 transitions. [2025-03-03 15:18:15,341 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2487 transitions. Word has length 101 [2025-03-03 15:18:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2487 transitions. [2025-03-03 15:18:15,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2487 transitions. [2025-03-03 15:18:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:18:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:15,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:15,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:18:15,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:15,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1414816462, now seen corresponding path program 1 times [2025-03-03 15:18:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929796649] [2025-03-03 15:18:15,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:15,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:18:15,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:18:15,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:15,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929796649] [2025-03-03 15:18:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929796649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:15,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060596185] [2025-03-03 15:18:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:15,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:15,594 INFO L87 Difference]: Start difference. First operand 1840 states and 2487 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:16,262 INFO L93 Difference]: Finished difference Result 2097 states and 2778 transitions. [2025-03-03 15:18:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-03 15:18:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:16,265 INFO L225 Difference]: With dead ends: 2097 [2025-03-03 15:18:16,266 INFO L226 Difference]: Without dead ends: 1219 [2025-03-03 15:18:16,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:16,267 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 4802 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4802 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:16,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4802 Valid, 835 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:18:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-03 15:18:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2025-03-03 15:18:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1190 states have (on average 1.3865546218487395) internal successors, (1650), 1218 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1650 transitions. [2025-03-03 15:18:16,280 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1650 transitions. Word has length 102 [2025-03-03 15:18:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:16,280 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1650 transitions. [2025-03-03 15:18:16,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1650 transitions. [2025-03-03 15:18:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:18:16,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:16,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:16,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:18:16,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:16,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2122887825, now seen corresponding path program 1 times [2025-03-03 15:18:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554939272] [2025-03-03 15:18:16,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:16,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:18:16,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:18:16,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:16,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554939272] [2025-03-03 15:18:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554939272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110360450] [2025-03-03 15:18:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:16,439 INFO L87 Difference]: Start difference. First operand 1219 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:16,906 INFO L93 Difference]: Finished difference Result 1786 states and 2430 transitions. [2025-03-03 15:18:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 15:18:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:16,909 INFO L225 Difference]: With dead ends: 1786 [2025-03-03 15:18:16,909 INFO L226 Difference]: Without dead ends: 1125 [2025-03-03 15:18:16,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:16,910 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4542 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 848 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-03 15:18:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2025-03-03 15:18:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1096 states have (on average 1.4041970802919708) internal successors, (1539), 1124 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1539 transitions. [2025-03-03 15:18:16,925 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1539 transitions. Word has length 103 [2025-03-03 15:18:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1539 transitions. [2025-03-03 15:18:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1539 transitions. [2025-03-03 15:18:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:18:16,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:16,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:18:16,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 662969568, now seen corresponding path program 1 times [2025-03-03 15:18:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090999185] [2025-03-03 15:18:16,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:16,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:18:16,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:18:16,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:16,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090999185] [2025-03-03 15:18:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090999185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185874092] [2025-03-03 15:18:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:17,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:17,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:17,069 INFO L87 Difference]: Start difference. First operand 1125 states and 1539 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:17,857 INFO L93 Difference]: Finished difference Result 2281 states and 3139 transitions. [2025-03-03 15:18:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:17,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-03 15:18:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:17,861 INFO L225 Difference]: With dead ends: 2281 [2025-03-03 15:18:17,861 INFO L226 Difference]: Without dead ends: 1666 [2025-03-03 15:18:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:17,862 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 6015 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6015 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:17,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6015 Valid, 1267 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:18:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-03 15:18:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1564. [2025-03-03 15:18:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1535 states have (on average 1.441042345276873) internal successors, (2212), 1563 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2212 transitions. [2025-03-03 15:18:17,882 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2212 transitions. Word has length 104 [2025-03-03 15:18:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:17,882 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2212 transitions. [2025-03-03 15:18:17,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2212 transitions. [2025-03-03 15:18:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:18:17,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:17,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:17,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:18:17,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:17,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1079513908, now seen corresponding path program 1 times [2025-03-03 15:18:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:17,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079346514] [2025-03-03 15:18:17,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:17,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:18:17,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:18:17,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079346514] [2025-03-03 15:18:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079346514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176319198] [2025-03-03 15:18:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:18,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:18,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:18,008 INFO L87 Difference]: Start difference. First operand 1564 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:18,810 INFO L93 Difference]: Finished difference Result 2228 states and 3140 transitions. [2025-03-03 15:18:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-03 15:18:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:18,815 INFO L225 Difference]: With dead ends: 2228 [2025-03-03 15:18:18,815 INFO L226 Difference]: Without dead ends: 1556 [2025-03-03 15:18:18,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:18,817 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 4254 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4254 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:18,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4254 Valid, 649 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:18:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-03 15:18:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-03-03 15:18:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.441388343156516) internal successors, (2201), 1555 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2201 transitions. [2025-03-03 15:18:18,850 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2201 transitions. Word has length 105 [2025-03-03 15:18:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:18,851 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2201 transitions. [2025-03-03 15:18:18,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2201 transitions. [2025-03-03 15:18:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:18,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:18,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:18,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:18:18,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:18,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 991030886, now seen corresponding path program 1 times [2025-03-03 15:18:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554264535] [2025-03-03 15:18:18,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:18,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:18,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:18,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554264535] [2025-03-03 15:18:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554264535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:18:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763272507] [2025-03-03 15:18:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:18:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:18:19,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:18:19,382 INFO L87 Difference]: Start difference. First operand 1556 states and 2201 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:20,888 INFO L93 Difference]: Finished difference Result 2847 states and 4035 transitions. [2025-03-03 15:18:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:20,894 INFO L225 Difference]: With dead ends: 2847 [2025-03-03 15:18:20,894 INFO L226 Difference]: Without dead ends: 2427 [2025-03-03 15:18:20,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:18:20,896 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 6239 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6239 SdHoareTripleChecker+Valid, 4338 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:20,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6239 Valid, 4338 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:18:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2025-03-03 15:18:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1556. [2025-03-03 15:18:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4400785854616895) internal successors, (2199), 1555 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2199 transitions. [2025-03-03 15:18:20,923 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2199 transitions. Word has length 106 [2025-03-03 15:18:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2199 transitions. [2025-03-03 15:18:20,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2199 transitions. [2025-03-03 15:18:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:20,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:20,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:18:20,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -612833560, now seen corresponding path program 1 times [2025-03-03 15:18:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887679261] [2025-03-03 15:18:20,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:20,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:20,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:20,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:20,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887679261] [2025-03-03 15:18:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887679261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:18:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699126825] [2025-03-03 15:18:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:18:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:21,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:18:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:18:21,360 INFO L87 Difference]: Start difference. First operand 1556 states and 2199 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:23,102 INFO L93 Difference]: Finished difference Result 2518 states and 3543 transitions. [2025-03-03 15:18:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:23,108 INFO L225 Difference]: With dead ends: 2518 [2025-03-03 15:18:23,108 INFO L226 Difference]: Without dead ends: 2328 [2025-03-03 15:18:23,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:18:23,109 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 6780 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6780 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:23,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6780 Valid, 4644 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:18:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2025-03-03 15:18:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1556. [2025-03-03 15:18:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.438768827766863) internal successors, (2197), 1555 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2197 transitions. [2025-03-03 15:18:23,136 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2197 transitions. Word has length 106 [2025-03-03 15:18:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2197 transitions. [2025-03-03 15:18:23,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2197 transitions. [2025-03-03 15:18:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:23,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:23,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:23,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:18:23,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:23,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 452961098, now seen corresponding path program 1 times [2025-03-03 15:18:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282885797] [2025-03-03 15:18:23,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:23,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:23,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:23,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:23,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282885797] [2025-03-03 15:18:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282885797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:18:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961278859] [2025-03-03 15:18:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:18:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:23,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:18:23,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:18:23,464 INFO L87 Difference]: Start difference. First operand 1556 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:24,740 INFO L93 Difference]: Finished difference Result 2679 states and 3659 transitions. [2025-03-03 15:18:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:18:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:24,745 INFO L225 Difference]: With dead ends: 2679 [2025-03-03 15:18:24,745 INFO L226 Difference]: Without dead ends: 2015 [2025-03-03 15:18:24,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:24,746 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 6627 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6627 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:24,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6627 Valid, 2194 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-03-03 15:18:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1556. [2025-03-03 15:18:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4381139489194499) internal successors, (2196), 1555 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2196 transitions. [2025-03-03 15:18:24,763 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2196 transitions. Word has length 106 [2025-03-03 15:18:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:24,763 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2196 transitions. [2025-03-03 15:18:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2196 transitions. [2025-03-03 15:18:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:24,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:24,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:24,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:18:24,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2072095560, now seen corresponding path program 1 times [2025-03-03 15:18:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676622010] [2025-03-03 15:18:24,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:24,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:24,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:24,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:24,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676622010] [2025-03-03 15:18:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676622010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:25,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053233926] [2025-03-03 15:18:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:25,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:25,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:25,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:25,142 INFO L87 Difference]: Start difference. First operand 1556 states and 2196 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:26,827 INFO L93 Difference]: Finished difference Result 2617 states and 3686 transitions. [2025-03-03 15:18:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:26,833 INFO L225 Difference]: With dead ends: 2617 [2025-03-03 15:18:26,833 INFO L226 Difference]: Without dead ends: 2417 [2025-03-03 15:18:26,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:18:26,835 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 3904 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 4131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3904 SdHoareTripleChecker+Valid, 4699 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:26,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3904 Valid, 4699 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4131 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:18:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-03-03 15:18:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1571. [2025-03-03 15:18:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4377431906614786) internal successors, (2217), 1570 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2217 transitions. [2025-03-03 15:18:26,855 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2217 transitions. Word has length 106 [2025-03-03 15:18:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:26,856 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2217 transitions. [2025-03-03 15:18:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2217 transitions. [2025-03-03 15:18:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:26,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:26,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:18:26,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash 217540033, now seen corresponding path program 1 times [2025-03-03 15:18:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103818975] [2025-03-03 15:18:26,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:26,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:26,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:26,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:26,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103818975] [2025-03-03 15:18:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103818975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:27,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026385489] [2025-03-03 15:18:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:27,248 INFO L87 Difference]: Start difference. First operand 1571 states and 2217 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:28,774 INFO L93 Difference]: Finished difference Result 2580 states and 3618 transitions. [2025-03-03 15:18:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:28,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:28,779 INFO L225 Difference]: With dead ends: 2580 [2025-03-03 15:18:28,779 INFO L226 Difference]: Without dead ends: 2402 [2025-03-03 15:18:28,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:18:28,781 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 9818 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9818 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:28,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9818 Valid, 4303 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:18:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-03-03 15:18:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1575. [2025-03-03 15:18:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4379042690815007) internal successors, (2223), 1574 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2223 transitions. [2025-03-03 15:18:28,798 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2223 transitions. Word has length 106 [2025-03-03 15:18:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:28,798 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2223 transitions. [2025-03-03 15:18:28,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2223 transitions. [2025-03-03 15:18:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:28,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:28,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:28,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:18:28,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:28,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1203081725, now seen corresponding path program 1 times [2025-03-03 15:18:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700304029] [2025-03-03 15:18:28,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:28,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700304029] [2025-03-03 15:18:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700304029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:29,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439710249] [2025-03-03 15:18:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:29,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:29,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:29,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:29,059 INFO L87 Difference]: Start difference. First operand 1575 states and 2223 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:30,238 INFO L93 Difference]: Finished difference Result 2028 states and 2883 transitions. [2025-03-03 15:18:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:30,242 INFO L225 Difference]: With dead ends: 2028 [2025-03-03 15:18:30,242 INFO L226 Difference]: Without dead ends: 1644 [2025-03-03 15:18:30,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:30,242 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 5373 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5373 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:30,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5373 Valid, 3769 Invalid, 3202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 3196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-03 15:18:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1556. [2025-03-03 15:18:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4374590700720367) internal successors, (2195), 1555 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2195 transitions. [2025-03-03 15:18:30,261 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2195 transitions. Word has length 106 [2025-03-03 15:18:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:30,262 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2195 transitions. [2025-03-03 15:18:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2195 transitions. [2025-03-03 15:18:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:18:30,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:30,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:30,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:18:30,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1488662017, now seen corresponding path program 1 times [2025-03-03 15:18:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73543698] [2025-03-03 15:18:30,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:30,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:18:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:18:30,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:30,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73543698] [2025-03-03 15:18:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73543698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627059079] [2025-03-03 15:18:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:30,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:30,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:30,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:30,571 INFO L87 Difference]: Start difference. First operand 1556 states and 2195 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:31,805 INFO L93 Difference]: Finished difference Result 2620 states and 3709 transitions. [2025-03-03 15:18:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:18:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:31,810 INFO L225 Difference]: With dead ends: 2620 [2025-03-03 15:18:31,810 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:18:31,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:31,811 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 3622 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3622 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:31,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3622 Valid, 4006 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:18:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:18:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4368041912246234) internal successors, (2194), 1555 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2194 transitions. [2025-03-03 15:18:31,825 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2194 transitions. Word has length 106 [2025-03-03 15:18:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2194 transitions. [2025-03-03 15:18:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2194 transitions. [2025-03-03 15:18:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:31,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:31,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:18:31,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:31,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -588440999, now seen corresponding path program 1 times [2025-03-03 15:18:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:31,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348925325] [2025-03-03 15:18:31,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:31,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:31,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:31,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:32,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348925325] [2025-03-03 15:18:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348925325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369664150] [2025-03-03 15:18:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:32,053 INFO L87 Difference]: Start difference. First operand 1556 states and 2194 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:33,121 INFO L93 Difference]: Finished difference Result 2379 states and 3371 transitions. [2025-03-03 15:18:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:33,124 INFO L225 Difference]: With dead ends: 2379 [2025-03-03 15:18:33,124 INFO L226 Difference]: Without dead ends: 1729 [2025-03-03 15:18:33,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:18:33,126 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 4109 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:33,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 3731 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:18:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-03 15:18:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1556. [2025-03-03 15:18:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.435494433529797) internal successors, (2192), 1555 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2192 transitions. [2025-03-03 15:18:33,143 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2192 transitions. Word has length 108 [2025-03-03 15:18:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:33,143 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2192 transitions. [2025-03-03 15:18:33,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2192 transitions. [2025-03-03 15:18:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:33,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:33,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:18:33,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:33,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 932754200, now seen corresponding path program 1 times [2025-03-03 15:18:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563541801] [2025-03-03 15:18:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:33,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:33,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:33,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:33,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563541801] [2025-03-03 15:18:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563541801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303627738] [2025-03-03 15:18:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:33,385 INFO L87 Difference]: Start difference. First operand 1556 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:34,770 INFO L93 Difference]: Finished difference Result 2799 states and 3964 transitions. [2025-03-03 15:18:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:34,774 INFO L225 Difference]: With dead ends: 2799 [2025-03-03 15:18:34,774 INFO L226 Difference]: Without dead ends: 2431 [2025-03-03 15:18:34,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:18:34,775 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 5976 mSDsluCounter, 4056 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 5291 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:34,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 5291 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:18:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-03 15:18:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1556. [2025-03-03 15:18:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4341846758349706) internal successors, (2190), 1555 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2190 transitions. [2025-03-03 15:18:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2190 transitions. Word has length 108 [2025-03-03 15:18:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:34,790 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2190 transitions. [2025-03-03 15:18:34,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2190 transitions. [2025-03-03 15:18:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:34,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:34,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:18:34,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1320089639, now seen corresponding path program 1 times [2025-03-03 15:18:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462863806] [2025-03-03 15:18:34,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:34,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:34,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:34,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462863806] [2025-03-03 15:18:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462863806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971134920] [2025-03-03 15:18:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:34,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:34,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:34,986 INFO L87 Difference]: Start difference. First operand 1556 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:36,230 INFO L93 Difference]: Finished difference Result 2664 states and 3768 transitions. [2025-03-03 15:18:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:36,233 INFO L225 Difference]: With dead ends: 2664 [2025-03-03 15:18:36,234 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:18:36,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:18:36,234 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 5341 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:36,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 4345 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:18:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:18:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4328749181401441) internal successors, (2188), 1555 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2188 transitions. [2025-03-03 15:18:36,247 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2188 transitions. Word has length 108 [2025-03-03 15:18:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:36,247 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2188 transitions. [2025-03-03 15:18:36,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2188 transitions. [2025-03-03 15:18:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:36,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:36,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:18:36,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2102697192, now seen corresponding path program 1 times [2025-03-03 15:18:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421744750] [2025-03-03 15:18:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:36,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:36,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:36,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:36,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421744750] [2025-03-03 15:18:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421744750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683053807] [2025-03-03 15:18:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:36,647 INFO L87 Difference]: Start difference. First operand 1556 states and 2188 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:38,853 INFO L93 Difference]: Finished difference Result 3435 states and 4910 transitions. [2025-03-03 15:18:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:18:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:38,859 INFO L225 Difference]: With dead ends: 3435 [2025-03-03 15:18:38,860 INFO L226 Difference]: Without dead ends: 3151 [2025-03-03 15:18:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:18:38,862 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 10015 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 5632 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10015 SdHoareTripleChecker+Valid, 6665 SdHoareTripleChecker+Invalid, 5934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 5632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10015 Valid, 6665 Invalid, 5934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 5632 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:18:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2025-03-03 15:18:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1560. [2025-03-03 15:18:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4317439581972566) internal successors, (2192), 1559 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2192 transitions. [2025-03-03 15:18:38,886 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2192 transitions. Word has length 108 [2025-03-03 15:18:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:38,886 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2192 transitions. [2025-03-03 15:18:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2192 transitions. [2025-03-03 15:18:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:38,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:38,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:18:38,888 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 453524738, now seen corresponding path program 1 times [2025-03-03 15:18:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096445013] [2025-03-03 15:18:38,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:38,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:38,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:38,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:38,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:39,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096445013] [2025-03-03 15:18:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096445013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205246731] [2025-03-03 15:18:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:39,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:39,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:39,126 INFO L87 Difference]: Start difference. First operand 1560 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:40,279 INFO L93 Difference]: Finished difference Result 2575 states and 3626 transitions. [2025-03-03 15:18:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:40,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:40,283 INFO L225 Difference]: With dead ends: 2575 [2025-03-03 15:18:40,283 INFO L226 Difference]: Without dead ends: 2384 [2025-03-03 15:18:40,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:40,284 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 5698 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5698 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:40,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5698 Valid, 3771 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-03-03 15:18:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1560. [2025-03-03 15:18:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4310907903331156) internal successors, (2191), 1559 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2191 transitions. [2025-03-03 15:18:40,297 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2191 transitions. Word has length 108 [2025-03-03 15:18:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:40,297 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2191 transitions. [2025-03-03 15:18:40,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2191 transitions. [2025-03-03 15:18:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:40,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:40,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:18:40,299 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1608586926, now seen corresponding path program 1 times [2025-03-03 15:18:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196353201] [2025-03-03 15:18:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:40,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:40,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:40,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196353201] [2025-03-03 15:18:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196353201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:40,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021810982] [2025-03-03 15:18:40,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:40,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:40,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:40,506 INFO L87 Difference]: Start difference. First operand 1560 states and 2191 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:41,647 INFO L93 Difference]: Finished difference Result 2252 states and 3104 transitions. [2025-03-03 15:18:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:41,651 INFO L225 Difference]: With dead ends: 2252 [2025-03-03 15:18:41,651 INFO L226 Difference]: Without dead ends: 2247 [2025-03-03 15:18:41,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:41,653 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 6036 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6036 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:41,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6036 Valid, 3149 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2025-03-03 15:18:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1560. [2025-03-03 15:18:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4304376224689745) internal successors, (2190), 1559 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2190 transitions. [2025-03-03 15:18:41,670 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2190 transitions. Word has length 108 [2025-03-03 15:18:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:41,670 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2190 transitions. [2025-03-03 15:18:41,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2190 transitions. [2025-03-03 15:18:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:41,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:41,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:18:41,672 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:41,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash 886979186, now seen corresponding path program 1 times [2025-03-03 15:18:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465649173] [2025-03-03 15:18:41,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:41,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:41,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:41,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:41,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465649173] [2025-03-03 15:18:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465649173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603428925] [2025-03-03 15:18:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:41,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:41,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:41,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:41,870 INFO L87 Difference]: Start difference. First operand 1560 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:43,169 INFO L93 Difference]: Finished difference Result 2695 states and 3812 transitions. [2025-03-03 15:18:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:43,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:43,173 INFO L225 Difference]: With dead ends: 2695 [2025-03-03 15:18:43,173 INFO L226 Difference]: Without dead ends: 2431 [2025-03-03 15:18:43,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:18:43,174 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 4076 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 3832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:43,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 4741 Invalid, 3832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-03 15:18:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1560. [2025-03-03 15:18:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4297844546048335) internal successors, (2189), 1559 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2189 transitions. [2025-03-03 15:18:43,189 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2189 transitions. Word has length 108 [2025-03-03 15:18:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:43,189 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2189 transitions. [2025-03-03 15:18:43,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2189 transitions. [2025-03-03 15:18:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:43,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:43,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:18:43,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 629004595, now seen corresponding path program 1 times [2025-03-03 15:18:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264080235] [2025-03-03 15:18:43,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:43,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:43,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:43,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264080235] [2025-03-03 15:18:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264080235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:43,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:43,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:43,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929317325] [2025-03-03 15:18:43,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:43,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:43,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:43,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:43,382 INFO L87 Difference]: Start difference. First operand 1560 states and 2189 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:44,513 INFO L93 Difference]: Finished difference Result 2510 states and 3515 transitions. [2025-03-03 15:18:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:18:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:44,519 INFO L225 Difference]: With dead ends: 2510 [2025-03-03 15:18:44,519 INFO L226 Difference]: Without dead ends: 2336 [2025-03-03 15:18:44,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:44,521 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 7996 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 2985 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7996 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:44,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7996 Valid, 3440 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2985 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-03 15:18:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1560. [2025-03-03 15:18:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4291312867406925) internal successors, (2188), 1559 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2188 transitions. [2025-03-03 15:18:44,537 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2188 transitions. Word has length 108 [2025-03-03 15:18:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:44,537 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2188 transitions. [2025-03-03 15:18:44,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2188 transitions. [2025-03-03 15:18:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:18:44,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:44,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:44,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:18:44,539 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:44,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1874781172, now seen corresponding path program 1 times [2025-03-03 15:18:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246862431] [2025-03-03 15:18:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:44,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:18:44,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:18:44,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:44,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246862431] [2025-03-03 15:18:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246862431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249661644] [2025-03-03 15:18:44,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:44,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:44,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:44,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:44,758 INFO L87 Difference]: Start difference. First operand 1560 states and 2188 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:46,331 INFO L93 Difference]: Finished difference Result 2715 states and 3832 transitions. [2025-03-03 15:18:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-03 15:18:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:46,334 INFO L225 Difference]: With dead ends: 2715 [2025-03-03 15:18:46,334 INFO L226 Difference]: Without dead ends: 2431 [2025-03-03 15:18:46,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:46,335 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 4483 mSDsluCounter, 4962 mSDsCounter, 0 mSdLazyCounter, 4974 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:46,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 6199 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4974 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:18:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-03 15:18:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1556. [2025-03-03 15:18:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.429600523903078) internal successors, (2183), 1555 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2183 transitions. [2025-03-03 15:18:46,350 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2183 transitions. Word has length 109 [2025-03-03 15:18:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2183 transitions. [2025-03-03 15:18:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2183 transitions. [2025-03-03 15:18:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:46,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:46,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:46,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:18:46,352 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -974575062, now seen corresponding path program 1 times [2025-03-03 15:18:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106562218] [2025-03-03 15:18:46,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:46,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:46,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:46,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:46,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106562218] [2025-03-03 15:18:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106562218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125613198] [2025-03-03 15:18:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:46,577 INFO L87 Difference]: Start difference. First operand 1556 states and 2183 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:48,078 INFO L93 Difference]: Finished difference Result 2684 states and 3781 transitions. [2025-03-03 15:18:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:48,082 INFO L225 Difference]: With dead ends: 2684 [2025-03-03 15:18:48,082 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:18:48,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:18:48,083 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 6045 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 4811 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6045 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:48,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6045 Valid, 5866 Invalid, 4818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4811 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:18:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:18:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:18:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4282907662082516) internal successors, (2181), 1555 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2181 transitions. [2025-03-03 15:18:48,099 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2181 transitions. Word has length 110 [2025-03-03 15:18:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2181 transitions. [2025-03-03 15:18:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2181 transitions. [2025-03-03 15:18:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:48,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:48,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:48,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:18:48,102 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:48,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1527538036, now seen corresponding path program 1 times [2025-03-03 15:18:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:48,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69734218] [2025-03-03 15:18:48,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:48,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:48,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69734218] [2025-03-03 15:18:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69734218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:48,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870883917] [2025-03-03 15:18:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:48,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:48,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:48,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:48,297 INFO L87 Difference]: Start difference. First operand 1556 states and 2181 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:49,412 INFO L93 Difference]: Finished difference Result 2417 states and 3348 transitions. [2025-03-03 15:18:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:49,415 INFO L225 Difference]: With dead ends: 2417 [2025-03-03 15:18:49,415 INFO L226 Difference]: Without dead ends: 2243 [2025-03-03 15:18:49,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:49,416 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 5990 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5990 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:49,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5990 Valid, 3169 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-03 15:18:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-03 15:18:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.426981008513425) internal successors, (2179), 1555 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2179 transitions. [2025-03-03 15:18:49,431 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2179 transitions. Word has length 110 [2025-03-03 15:18:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2179 transitions. [2025-03-03 15:18:49,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2179 transitions. [2025-03-03 15:18:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:49,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:49,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:49,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:18:49,433 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1348385272, now seen corresponding path program 1 times [2025-03-03 15:18:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:49,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326190854] [2025-03-03 15:18:49,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:49,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:49,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:49,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326190854] [2025-03-03 15:18:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326190854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050818339] [2025-03-03 15:18:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:49,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:49,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:49,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:49,642 INFO L87 Difference]: Start difference. First operand 1556 states and 2179 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:50,987 INFO L93 Difference]: Finished difference Result 2668 states and 3754 transitions. [2025-03-03 15:18:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:50,990 INFO L225 Difference]: With dead ends: 2668 [2025-03-03 15:18:50,990 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:18:50,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:50,991 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 6237 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6237 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:50,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6237 Valid, 4978 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:18:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:18:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4256712508185985) internal successors, (2177), 1555 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2177 transitions. [2025-03-03 15:18:51,005 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2177 transitions. Word has length 110 [2025-03-03 15:18:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2177 transitions. [2025-03-03 15:18:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2177 transitions. [2025-03-03 15:18:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:51,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:18:51,007 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash 920215290, now seen corresponding path program 1 times [2025-03-03 15:18:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:51,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085034110] [2025-03-03 15:18:51,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:51,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:51,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:51,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:51,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085034110] [2025-03-03 15:18:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085034110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809667167] [2025-03-03 15:18:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:51,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:51,217 INFO L87 Difference]: Start difference. First operand 1556 states and 2177 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:52,699 INFO L93 Difference]: Finished difference Result 2590 states and 3635 transitions. [2025-03-03 15:18:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:52,702 INFO L225 Difference]: With dead ends: 2590 [2025-03-03 15:18:52,702 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:18:52,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:18:52,703 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 4950 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 4149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:52,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 5005 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4149 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:18:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:18:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-03 15:18:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.424361493123772) internal successors, (2175), 1555 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2175 transitions. [2025-03-03 15:18:52,715 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2175 transitions. Word has length 110 [2025-03-03 15:18:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2175 transitions. [2025-03-03 15:18:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2175 transitions. [2025-03-03 15:18:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:52,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:52,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:52,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:18:52,717 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1270637768, now seen corresponding path program 1 times [2025-03-03 15:18:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710564402] [2025-03-03 15:18:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:52,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:52,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:52,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:52,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710564402] [2025-03-03 15:18:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710564402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923345207] [2025-03-03 15:18:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:52,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:52,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:52,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:52,903 INFO L87 Difference]: Start difference. First operand 1556 states and 2175 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:54,129 INFO L93 Difference]: Finished difference Result 2590 states and 3633 transitions. [2025-03-03 15:18:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:54,132 INFO L225 Difference]: With dead ends: 2590 [2025-03-03 15:18:54,132 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:18:54,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:54,133 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 5379 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5379 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:54,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5379 Valid, 4135 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:18:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-03 15:18:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4230517354289456) internal successors, (2173), 1555 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2173 transitions. [2025-03-03 15:18:54,145 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2173 transitions. Word has length 110 [2025-03-03 15:18:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:54,145 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2173 transitions. [2025-03-03 15:18:54,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2173 transitions. [2025-03-03 15:18:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:54,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:54,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:54,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:18:54,146 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:54,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 305779289, now seen corresponding path program 1 times [2025-03-03 15:18:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529746613] [2025-03-03 15:18:54,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:54,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529746613] [2025-03-03 15:18:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529746613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:54,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638863761] [2025-03-03 15:18:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:54,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:54,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:54,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:54,316 INFO L87 Difference]: Start difference. First operand 1556 states and 2173 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:55,420 INFO L93 Difference]: Finished difference Result 2413 states and 3333 transitions. [2025-03-03 15:18:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:55,422 INFO L225 Difference]: With dead ends: 2413 [2025-03-03 15:18:55,422 INFO L226 Difference]: Without dead ends: 2243 [2025-03-03 15:18:55,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:55,423 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 5974 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5974 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:55,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5974 Valid, 3169 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2897 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-03 15:18:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-03 15:18:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4217419777341191) internal successors, (2171), 1555 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2171 transitions. [2025-03-03 15:18:55,439 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2171 transitions. Word has length 110 [2025-03-03 15:18:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:55,439 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2171 transitions. [2025-03-03 15:18:55,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2171 transitions. [2025-03-03 15:18:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:55,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:55,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:18:55,442 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2127607784, now seen corresponding path program 1 times [2025-03-03 15:18:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945253939] [2025-03-03 15:18:55,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:55,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:55,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:55,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:55,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945253939] [2025-03-03 15:18:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945253939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065009149] [2025-03-03 15:18:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:55,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:55,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:55,618 INFO L87 Difference]: Start difference. First operand 1556 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:56,939 INFO L93 Difference]: Finished difference Result 2634 states and 3693 transitions. [2025-03-03 15:18:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:56,942 INFO L225 Difference]: With dead ends: 2634 [2025-03-03 15:18:56,942 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:18:56,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:56,943 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 3024 mSDsluCounter, 3955 mSDsCounter, 0 mSdLazyCounter, 4280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3024 SdHoareTripleChecker+Valid, 5164 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:56,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3024 Valid, 5164 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:18:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:18:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.421087098886706) internal successors, (2170), 1555 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2170 transitions. [2025-03-03 15:18:56,954 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2170 transitions. Word has length 110 [2025-03-03 15:18:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2170 transitions. [2025-03-03 15:18:56,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2170 transitions. [2025-03-03 15:18:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:56,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:56,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:18:56,957 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:56,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1147569501, now seen corresponding path program 1 times [2025-03-03 15:18:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211408757] [2025-03-03 15:18:56,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:56,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:56,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:56,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211408757] [2025-03-03 15:18:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211408757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600735071] [2025-03-03 15:18:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:57,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:57,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:57,140 INFO L87 Difference]: Start difference. First operand 1556 states and 2170 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:58,398 INFO L93 Difference]: Finished difference Result 2571 states and 3599 transitions. [2025-03-03 15:18:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:58,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:58,400 INFO L225 Difference]: With dead ends: 2571 [2025-03-03 15:18:58,400 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:18:58,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:58,401 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 7017 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7017 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:58,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7017 Valid, 4346 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:18:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-03 15:18:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4204322200392927) internal successors, (2169), 1555 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2169 transitions. [2025-03-03 15:18:58,413 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2169 transitions. Word has length 110 [2025-03-03 15:18:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:58,413 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2169 transitions. [2025-03-03 15:18:58,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2169 transitions. [2025-03-03 15:18:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:58,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:58,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:18:58,414 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -559632590, now seen corresponding path program 1 times [2025-03-03 15:18:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393232321] [2025-03-03 15:18:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:58,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:58,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393232321] [2025-03-03 15:18:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393232321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761539165] [2025-03-03 15:18:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:58,613 INFO L87 Difference]: Start difference. First operand 1556 states and 2169 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:59,843 INFO L93 Difference]: Finished difference Result 2565 states and 3592 transitions. [2025-03-03 15:18:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:59,845 INFO L225 Difference]: With dead ends: 2565 [2025-03-03 15:18:59,845 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:18:59,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:59,846 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 7014 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7014 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 3608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:59,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7014 Valid, 4346 Invalid, 3608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:18:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-03 15:18:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4197773411918795) internal successors, (2168), 1555 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2168 transitions. [2025-03-03 15:18:59,864 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2168 transitions. Word has length 110 [2025-03-03 15:18:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:59,865 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2168 transitions. [2025-03-03 15:18:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2168 transitions. [2025-03-03 15:18:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:59,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:18:59,867 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1473406524, now seen corresponding path program 1 times [2025-03-03 15:18:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398729961] [2025-03-03 15:18:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:59,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:59,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:59,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398729961] [2025-03-03 15:19:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398729961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:00,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:00,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093741092] [2025-03-03 15:19:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:00,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:00,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:00,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:00,053 INFO L87 Difference]: Start difference. First operand 1556 states and 2168 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:01,121 INFO L93 Difference]: Finished difference Result 2414 states and 3327 transitions. [2025-03-03 15:19:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:19:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:19:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:01,122 INFO L225 Difference]: With dead ends: 2414 [2025-03-03 15:19:01,122 INFO L226 Difference]: Without dead ends: 2243 [2025-03-03 15:19:01,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:01,123 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 7873 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7873 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:01,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7873 Valid, 3169 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:19:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-03 15:19:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-03 15:19:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4191224623444663) internal successors, (2167), 1555 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2167 transitions. [2025-03-03 15:19:01,134 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2167 transitions. Word has length 110 [2025-03-03 15:19:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:01,134 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2167 transitions. [2025-03-03 15:19:01,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2167 transitions. [2025-03-03 15:19:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:19:01,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:01,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:19:01,136 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 982337748, now seen corresponding path program 1 times [2025-03-03 15:19:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485891732] [2025-03-03 15:19:01,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:01,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:19:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:19:01,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485891732] [2025-03-03 15:19:01,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485891732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:01,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171198891] [2025-03-03 15:19:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:01,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:01,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:01,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:01,296 INFO L87 Difference]: Start difference. First operand 1556 states and 2167 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:02,585 INFO L93 Difference]: Finished difference Result 2619 states and 3671 transitions. [2025-03-03 15:19:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:19:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:19:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:02,587 INFO L225 Difference]: With dead ends: 2619 [2025-03-03 15:19:02,587 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:19:02,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:19:02,588 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 3111 mSDsluCounter, 3828 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:02,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3111 Valid, 4993 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:19:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:19:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:19:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.418467583497053) internal successors, (2166), 1555 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2166 transitions. [2025-03-03 15:19:02,603 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2166 transitions. Word has length 110 [2025-03-03 15:19:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2166 transitions. [2025-03-03 15:19:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2166 transitions. [2025-03-03 15:19:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:19:02,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:02,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:02,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:19:02,604 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1301663834, now seen corresponding path program 1 times [2025-03-03 15:19:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046335082] [2025-03-03 15:19:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:02,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:19:02,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:19:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:02,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-03 15:19:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046335082] [2025-03-03 15:19:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046335082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150924077] [2025-03-03 15:19:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:02,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:02,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:02,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:02,791 INFO L87 Difference]: Start difference. First operand 1556 states and 2166 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:03,883 INFO L93 Difference]: Finished difference Result 2411 states and 3321 transitions. [2025-03-03 15:19:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:19:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:19:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:03,886 INFO L225 Difference]: With dead ends: 2411 [2025-03-03 15:19:03,886 INFO L226 Difference]: Without dead ends: 2243 [2025-03-03 15:19:03,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:03,887 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 3989 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:03,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 3157 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:19:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-03 15:19:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-03 15:19:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4178127046496398) internal successors, (2165), 1555 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2165 transitions. [2025-03-03 15:19:03,901 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2165 transitions. Word has length 110 [2025-03-03 15:19:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:03,901 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2165 transitions. [2025-03-03 15:19:03,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2165 transitions. [2025-03-03 15:19:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:19:03,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:03,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:19:03,902 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1517002909, now seen corresponding path program 1 times [2025-03-03 15:19:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226151601] [2025-03-03 15:19:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:03,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:19:03,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:19:03,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226151601] [2025-03-03 15:19:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226151601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:04,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638102121] [2025-03-03 15:19:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:04,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:04,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:04,109 INFO L87 Difference]: Start difference. First operand 1556 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:05,244 INFO L93 Difference]: Finished difference Result 2506 states and 3484 transitions. [2025-03-03 15:19:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:19:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:19:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:05,247 INFO L225 Difference]: With dead ends: 2506 [2025-03-03 15:19:05,247 INFO L226 Difference]: Without dead ends: 2332 [2025-03-03 15:19:05,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:05,248 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 7529 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7529 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:05,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7529 Valid, 3712 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:19:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-03-03 15:19:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1556. [2025-03-03 15:19:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4171578258022266) internal successors, (2164), 1555 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2164 transitions. [2025-03-03 15:19:05,263 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2164 transitions. Word has length 110 [2025-03-03 15:19:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2164 transitions. [2025-03-03 15:19:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2164 transitions. [2025-03-03 15:19:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:19:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:05,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:05,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:19:05,265 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:05,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1672635950, now seen corresponding path program 1 times [2025-03-03 15:19:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991303018] [2025-03-03 15:19:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:05,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:19:05,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:19:05,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:05,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991303018] [2025-03-03 15:19:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991303018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833525085] [2025-03-03 15:19:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:05,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:05,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:05,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:05,494 INFO L87 Difference]: Start difference. First operand 1556 states and 2164 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:06,984 INFO L93 Difference]: Finished difference Result 2613 states and 3661 transitions. [2025-03-03 15:19:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:19:06,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:19:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:06,988 INFO L225 Difference]: With dead ends: 2613 [2025-03-03 15:19:06,988 INFO L226 Difference]: Without dead ends: 2404 [2025-03-03 15:19:06,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:19:06,989 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 5994 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 4728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5994 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5994 Valid, 5866 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4728 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:19:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-03 15:19:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-03 15:19:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4165029469548134) internal successors, (2163), 1555 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2163 transitions. [2025-03-03 15:19:07,001 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2163 transitions. Word has length 111 [2025-03-03 15:19:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:07,001 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2163 transitions. [2025-03-03 15:19:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2163 transitions. [2025-03-03 15:19:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:19:07,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:07,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:07,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:19:07,003 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:07,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1441478986, now seen corresponding path program 1 times [2025-03-03 15:19:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297801803] [2025-03-03 15:19:07,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:19:07,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:19:07,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:07,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297801803] [2025-03-03 15:19:07,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297801803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:07,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489160024] [2025-03-03 15:19:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:07,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:07,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:07,218 INFO L87 Difference]: Start difference. First operand 1556 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:08,515 INFO L93 Difference]: Finished difference Result 2564 states and 3583 transitions. [2025-03-03 15:19:08,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:19:08,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:19:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:08,517 INFO L225 Difference]: With dead ends: 2564 [2025-03-03 15:19:08,517 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:19:08,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:08,518 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 6591 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6591 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:08,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6591 Valid, 4626 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:19:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:19:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-03 15:19:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4158480681074002) internal successors, (2162), 1555 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2162 transitions. [2025-03-03 15:19:08,531 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2162 transitions. Word has length 111 [2025-03-03 15:19:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:08,531 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2162 transitions. [2025-03-03 15:19:08,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2162 transitions. [2025-03-03 15:19:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:19:08,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:08,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:08,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:19:08,533 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:08,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash -535694586, now seen corresponding path program 1 times [2025-03-03 15:19:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444104129] [2025-03-03 15:19:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:08,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:08,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:19:08,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:19:08,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:08,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444104129] [2025-03-03 15:19:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444104129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:08,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258082636] [2025-03-03 15:19:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:08,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:08,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:08,711 INFO L87 Difference]: Start difference. First operand 1556 states and 2162 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:09,832 INFO L93 Difference]: Finished difference Result 2522 states and 3499 transitions. [2025-03-03 15:19:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:19:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 15:19:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:09,834 INFO L225 Difference]: With dead ends: 2522 [2025-03-03 15:19:09,834 INFO L226 Difference]: Without dead ends: 2332 [2025-03-03 15:19:09,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:09,835 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 3640 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:09,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 3768 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:19:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-03-03 15:19:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1556. [2025-03-03 15:19:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4145383104125737) internal successors, (2160), 1555 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2160 transitions. [2025-03-03 15:19:09,848 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2160 transitions. Word has length 112 [2025-03-03 15:19:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2160 transitions. [2025-03-03 15:19:09,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2160 transitions. [2025-03-03 15:19:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:19:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:09,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:09,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:19:09,849 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 530100072, now seen corresponding path program 1 times [2025-03-03 15:19:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671851380] [2025-03-03 15:19:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:19:09,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:19:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671851380] [2025-03-03 15:19:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671851380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175113680] [2025-03-03 15:19:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:10,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:10,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:10,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:10,031 INFO L87 Difference]: Start difference. First operand 1556 states and 2160 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:11,066 INFO L93 Difference]: Finished difference Result 2417 states and 3321 transitions. [2025-03-03 15:19:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:19:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 15:19:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:11,069 INFO L225 Difference]: With dead ends: 2417 [2025-03-03 15:19:11,069 INFO L226 Difference]: Without dead ends: 2243 [2025-03-03 15:19:11,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:19:11,070 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 3940 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3940 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:11,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3940 Valid, 3244 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:19:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-03 15:19:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-03 15:19:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4132285527177473) internal successors, (2158), 1555 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2158 transitions. [2025-03-03 15:19:11,084 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2158 transitions. Word has length 112 [2025-03-03 15:19:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:11,085 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2158 transitions. [2025-03-03 15:19:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2158 transitions. [2025-03-03 15:19:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:19:11,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:11,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:11,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:19:11,086 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:19:11,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1250251944, now seen corresponding path program 1 times [2025-03-03 15:19:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649454451] [2025-03-03 15:19:11,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:11,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:19:11,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:19:11,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:11,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649454451] [2025-03-03 15:19:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649454451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424485916] [2025-03-03 15:19:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:11,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:11,279 INFO L87 Difference]: Start difference. First operand 1556 states and 2158 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)