./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.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 b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:28:14,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:28:14,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:28:14,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:28:14,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:28:15,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:28:15,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:28:15,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:28:15,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:28:15,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:28:15,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:28:15,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:28:15,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:28:15,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:28:15,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:28:15,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:28:15,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:28:15,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:28:15,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:28:15,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:28:15,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:28:15,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:28:15,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:28:15,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:28:15,030 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 -> b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c [2025-03-08 06:28:15,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:28:15,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:28:15,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:28:15,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:28:15,271 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:28:15,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:28:16,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fb781ee/5877992d3c62449781c759a11104bd98/FLAG5433a10e1 [2025-03-08 06:28:16,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:28:16,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:28:17,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fb781ee/5877992d3c62449781c759a11104bd98/FLAG5433a10e1 [2025-03-08 06:28:17,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fb781ee/5877992d3c62449781c759a11104bd98 [2025-03-08 06:28:17,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:28:17,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:28:17,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:28:17,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:28:17,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:28:17,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:17" (1/1) ... [2025-03-08 06:28:17,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0a220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:17, skipping insertion in model container [2025-03-08 06:28:17,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:17" (1/1) ... [2025-03-08 06:28:17,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:28:18,153 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2025-03-08 06:28:18,230 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2025-03-08 06:28:18,280 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2025-03-08 06:28:18,295 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2025-03-08 06:28:18,302 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2025-03-08 06:28:18,308 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2025-03-08 06:28:18,366 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2025-03-08 06:28:18,387 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2025-03-08 06:28:18,399 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2025-03-08 06:28:18,405 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2025-03-08 06:28:18,411 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2025-03-08 06:28:18,442 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2025-03-08 06:28:18,454 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2025-03-08 06:28:18,461 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2025-03-08 06:28:18,467 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2025-03-08 06:28:18,475 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2025-03-08 06:28:18,482 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2025-03-08 06:28:18,488 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2025-03-08 06:28:18,494 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2025-03-08 06:28:18,500 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2025-03-08 06:28:18,509 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2025-03-08 06:28:18,515 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2025-03-08 06:28:18,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:28:18,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:28:18,753 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2025-03-08 06:28:18,819 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2025-03-08 06:28:18,839 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2025-03-08 06:28:18,852 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2025-03-08 06:28:18,857 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2025-03-08 06:28:18,862 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2025-03-08 06:28:18,897 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2025-03-08 06:28:18,917 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2025-03-08 06:28:18,927 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2025-03-08 06:28:18,932 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2025-03-08 06:28:18,938 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2025-03-08 06:28:18,958 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2025-03-08 06:28:18,968 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2025-03-08 06:28:18,974 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2025-03-08 06:28:18,979 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2025-03-08 06:28:18,985 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2025-03-08 06:28:18,991 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2025-03-08 06:28:18,996 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2025-03-08 06:28:19,002 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2025-03-08 06:28:19,010 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2025-03-08 06:28:19,016 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2025-03-08 06:28:19,021 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.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2025-03-08 06:28:19,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:28:19,083 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:28:19,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19 WrapperNode [2025-03-08 06:28:19,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:28:19,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:28:19,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:28:19,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:28:19,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,302 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12202 [2025-03-08 06:28:19,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:28:19,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:28:19,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:28:19,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:28:19,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,399 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:28:19,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:28:19,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:28:19,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:28:19,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:28:19,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (1/1) ... [2025-03-08 06:28:19,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:28:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:28:19,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:28:19,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:28:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:28:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:28:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:28:19,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:28:19,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:28:19,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8166: havoc main_~node6__m6~37#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18473: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~72#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7379: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~33#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13457: havoc main_~check__tmp~62#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~61#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20592: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17952: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~63#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19805: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~93#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9236: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~35#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10033: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4220: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~15#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3432: havoc main_~node6__m6~14#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#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~10#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17969: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~70#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20348: havoc main_~node3__m3~68#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6607: havoc main_~check__tmp~25#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-08 06:28:24,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5022: havoc main_~check__tmp~18#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~18#1;havoc main_~node4__m4~16#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~17#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~3#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9253: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~42#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1854: havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#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-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~18#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20621: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11902: havoc main_~node6__m6~55#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~53#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16133: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~75#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12963: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~45#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16927: havoc main_~check__tmp~84#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~83#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17986: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~84#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10324: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18781: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14819: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~69#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13770: havoc main_~check__tmp~64#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~63#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12980: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~50#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20380: havoc main_~node4__m4~72#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~check__tmp~35#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5321: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~17#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~19#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11137: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~51#1; [2025-03-08 06:28:24,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L567: 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-08 06:28:24,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~9#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2155: havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#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-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6913: havoc main_~node6__m6~31#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19072: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12997: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~60#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17226: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1;havoc main_~node6__m6~80#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~10#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3756: havoc main_~node6__m6~16#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#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~11#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6135: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~27#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7986: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~27#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15650: havoc main_~check__tmp~76#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~75#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12216: havoc main_~check__tmp~55#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~54#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14069: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~66#1;havoc main_~node6__m6~65#1;havoc main_~node5__m5~54#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~65#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20412: havoc main_~node5__m5~80#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~12#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8003: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~30#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9854: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~45#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L343: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8805: havoc main_~check__tmp~37#1;havoc main_~node6__m6~40#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~36#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16737: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~65#1; [2025-03-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: 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-08 06:28:24,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15419: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~51#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8020: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~36#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4849: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~21#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17534: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~5#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: havoc main_~node6__m6~10#1;havoc main_~node5__m5~8#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-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19392: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7239: havoc main_~check__tmp~28#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~27#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18602: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~87#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10676: havoc main_~node6__m6~49#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16754: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~78#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15436: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~54#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12529: havoc main_~check__tmp~57#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~56#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~45#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: havoc main_~node6__m6~25#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:28:24,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4077: havoc main_~check__tmp~13#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#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~12#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~6#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9104: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13597: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~63#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17825: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14391: havoc main_~check__tmp~68#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~67#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15453: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~60#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11756: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~54#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19684: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20480: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~96#1; [2025-03-08 06:28:24,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15993: havoc main_~check__tmp~78#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~77#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10976: havoc main_~node6__m6~50#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15470: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~72#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6750: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~25#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12828: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~59#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~58#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962: havoc main_~node6__m6~26#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10457: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~33#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7552: havoc main_~check__tmp~30#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~29#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc main_~node6__m6~19#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~14#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~14#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14690: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~70#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~69#1; [2025-03-08 06:28:24,264 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~8#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~9#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-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215: havoc main_~node6__m6~4#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-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20508: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6767: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~30#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19987: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10474: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~34#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19196: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~75#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~15#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5459: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~17#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8632: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~39#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9426: havoc main_~check__tmp~41#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~36#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17355: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~81#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10491: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~36#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16306: havoc main_~check__tmp~80#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~63#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~79#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19213: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~90#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7851: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node6__m6~35#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20536: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11288: havoc main_~node6__m6~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-03-08 06:28:24,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5476: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~18#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20275: havoc main_~node1__m1~65#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1;havoc main_~node6__m6~95#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515: havoc main_~node6__m6~5#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-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13143: havoc main_~node6__m6~61#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~60#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14201: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~55#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14998: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~72#1;havoc main_~node6__m6~70#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~71#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12356: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~57#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18171: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1;havoc main_~node6__m6~85#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10508: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~40#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5493: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6286: havoc main_~node6__m6~28#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9725: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14218: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~66#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2328: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~9#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20564: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4709: havoc main_~check__tmp~16#1;havoc main_~node6__m6~20#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~15#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~15#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10525: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16605: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~82#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~81#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3131: havoc main_~node6__m6~13#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#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~9#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5510: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~24#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15289: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~74#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~73#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20316: havoc main_~node2__m2~66#1; [2025-03-08 06:28:24,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11596: havoc main_~check__tmp~52#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-08 06:28:24,771 INFO L? ?]: Removed 2222 outVars from TransFormulas that were not future-live. [2025-03-08 06:28:24,772 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:28:24,822 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:28:24,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:28:24,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:28:24 BoogieIcfgContainer [2025-03-08 06:28:24,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:28:24,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:28:24,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:28:24,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:28:24,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:28:17" (1/3) ... [2025-03-08 06:28:24,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333d8de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:28:24, skipping insertion in model container [2025-03-08 06:28:24,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:19" (2/3) ... [2025-03-08 06:28:24,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333d8de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:28:24, skipping insertion in model container [2025-03-08 06:28:24,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:28:24" (3/3) ... [2025-03-08 06:28:24,834 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:28:24,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:28:24,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 2348 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-08 06:28:24,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:28:24,950 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;@78e16d48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:28:24,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 06:28:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:28:24,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:24,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:24,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:24,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1381768955, now seen corresponding path program 1 times [2025-03-08 06:28:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514375908] [2025-03-08 06:28:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:28:25,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:28:25,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:25,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514375908] [2025-03-08 06:28:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514375908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:25,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982264934] [2025-03-08 06:28:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:25,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:25,630 INFO L87 Difference]: Start difference. First operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 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 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:26,901 INFO L93 Difference]: Finished difference Result 2676 states and 4754 transitions. [2025-03-08 06:28:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-08 06:28:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:26,923 INFO L225 Difference]: With dead ends: 2676 [2025-03-08 06:28:26,924 INFO L226 Difference]: Without dead ends: 1505 [2025-03-08 06:28:26,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:26,936 INFO L435 NwaCegarLoop]: 1447 mSDtfsCounter, 7827 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7827 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:26,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7827 Valid, 1509 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:28:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-08 06:28:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-08 06:28:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1483 states have (on average 1.3149022252191505) internal successors, (1950), 1504 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1950 transitions. [2025-03-08 06:28:27,023 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1950 transitions. Word has length 86 [2025-03-08 06:28:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:27,024 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1950 transitions. [2025-03-08 06:28:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1950 transitions. [2025-03-08 06:28:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:28:27,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:27,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:27,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:28:27,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:27,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1923461938, now seen corresponding path program 1 times [2025-03-08 06:28:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719499032] [2025-03-08 06:28:27,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:27,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:28:27,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:28:27,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:27,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:27,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-08 06:28:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719499032] [2025-03-08 06:28:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719499032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080997514] [2025-03-08 06:28:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:27,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:27,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:27,220 INFO L87 Difference]: Start difference. First operand 1505 states and 1950 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:27,978 INFO L93 Difference]: Finished difference Result 2031 states and 2656 transitions. [2025-03-08 06:28:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-08 06:28:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:27,982 INFO L225 Difference]: With dead ends: 2031 [2025-03-08 06:28:27,982 INFO L226 Difference]: Without dead ends: 1256 [2025-03-08 06:28:27,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:27,984 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 4919 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:27,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 779 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-08 06:28:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2025-03-08 06:28:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1234 states have (on average 1.3452188006482981) internal successors, (1660), 1255 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1660 transitions. [2025-03-08 06:28:28,010 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1660 transitions. Word has length 86 [2025-03-08 06:28:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:28,011 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1660 transitions. [2025-03-08 06:28:28,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1660 transitions. [2025-03-08 06:28:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:28:28,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:28,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:28,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:28:28,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:28,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1542236023, now seen corresponding path program 1 times [2025-03-08 06:28:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750799287] [2025-03-08 06:28:28,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:28,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:28:28,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:28:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750799287] [2025-03-08 06:28:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750799287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442984622] [2025-03-08 06:28:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:28,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:28,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:28,177 INFO L87 Difference]: Start difference. First operand 1256 states and 1660 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:28,927 INFO L93 Difference]: Finished difference Result 1823 states and 2426 transitions. [2025-03-08 06:28:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-08 06:28:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:28,933 INFO L225 Difference]: With dead ends: 1823 [2025-03-08 06:28:28,933 INFO L226 Difference]: Without dead ends: 1192 [2025-03-08 06:28:28,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:28,936 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4624 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:28,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 697 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-08 06:28:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2025-03-08 06:28:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1170 states have (on average 1.3564102564102565) internal successors, (1587), 1191 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1587 transitions. [2025-03-08 06:28:28,961 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1587 transitions. Word has length 86 [2025-03-08 06:28:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1587 transitions. [2025-03-08 06:28:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1587 transitions. [2025-03-08 06:28:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:28:28,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:28,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:28,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:28:28,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -209085593, now seen corresponding path program 1 times [2025-03-08 06:28:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414027527] [2025-03-08 06:28:28,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:28:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:28:29,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:29,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414027527] [2025-03-08 06:28:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414027527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539295609] [2025-03-08 06:28:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:29,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:29,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:29,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:29,154 INFO L87 Difference]: Start difference. First operand 1192 states and 1587 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:29,659 INFO L93 Difference]: Finished difference Result 1591 states and 2112 transitions. [2025-03-08 06:28:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:29,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 06:28:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:29,664 INFO L225 Difference]: With dead ends: 1591 [2025-03-08 06:28:29,664 INFO L226 Difference]: Without dead ends: 976 [2025-03-08 06:28:29,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:29,666 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 3836 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3836 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:29,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3836 Valid, 647 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-08 06:28:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-03-08 06:28:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 954 states have (on average 1.368972746331237) internal successors, (1306), 975 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1306 transitions. [2025-03-08 06:28:29,681 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1306 transitions. Word has length 87 [2025-03-08 06:28:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1306 transitions. [2025-03-08 06:28:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1306 transitions. [2025-03-08 06:28:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:28:29,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:29,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:29,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:28:29,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -954259636, now seen corresponding path program 1 times [2025-03-08 06:28:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140933748] [2025-03-08 06:28:29,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:29,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:28:29,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:28:29,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140933748] [2025-03-08 06:28:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140933748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955173798] [2025-03-08 06:28:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:29,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:29,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:29,824 INFO L87 Difference]: Start difference. First operand 976 states and 1306 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:30,167 INFO L93 Difference]: Finished difference Result 1165 states and 1524 transitions. [2025-03-08 06:28:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-08 06:28:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:30,170 INFO L225 Difference]: With dead ends: 1165 [2025-03-08 06:28:30,170 INFO L226 Difference]: Without dead ends: 682 [2025-03-08 06:28:30,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:30,171 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 2609 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:30,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 491 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:28:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-08 06:28:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-03-08 06:28:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 660 states have (on average 1.3742424242424243) internal successors, (907), 681 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 907 transitions. [2025-03-08 06:28:30,179 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 907 transitions. Word has length 88 [2025-03-08 06:28:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 907 transitions. [2025-03-08 06:28:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 907 transitions. [2025-03-08 06:28:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:28:30,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:30,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:30,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:28:30,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:30,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -283355437, now seen corresponding path program 1 times [2025-03-08 06:28:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:30,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936082505] [2025-03-08 06:28:30,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:30,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:28:30,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:28:30,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936082505] [2025-03-08 06:28:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936082505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626211075] [2025-03-08 06:28:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:30,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:30,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:30,346 INFO L87 Difference]: Start difference. First operand 682 states and 907 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:30,692 INFO L93 Difference]: Finished difference Result 1013 states and 1350 transitions. [2025-03-08 06:28:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:28:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:30,695 INFO L225 Difference]: With dead ends: 1013 [2025-03-08 06:28:30,695 INFO L226 Difference]: Without dead ends: 638 [2025-03-08 06:28:30,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:30,696 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2490 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:30,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2490 Valid, 488 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:28:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-08 06:28:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-03-08 06:28:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3831168831168832) internal successors, (852), 637 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 852 transitions. [2025-03-08 06:28:30,703 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 852 transitions. Word has length 89 [2025-03-08 06:28:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:30,703 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 852 transitions. [2025-03-08 06:28:30,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 852 transitions. [2025-03-08 06:28:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:28:30,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:30,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:30,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:28:30,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:30,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1636391385, now seen corresponding path program 1 times [2025-03-08 06:28:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931929510] [2025-03-08 06:28:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:30,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:28:30,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:28:30,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:30,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931929510] [2025-03-08 06:28:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931929510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:31,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:28:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429420190] [2025-03-08 06:28:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:28:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:31,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:28:31,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:28:31,082 INFO L87 Difference]: Start difference. First operand 638 states and 852 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:32,148 INFO L93 Difference]: Finished difference Result 1087 states and 1455 transitions. [2025-03-08 06:28:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:28:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:32,151 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 06:28:32,151 INFO L226 Difference]: Without dead ends: 973 [2025-03-08 06:28:32,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:28:32,152 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 3606 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3606 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:32,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3606 Valid, 2461 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-03-08 06:28:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 638. [2025-03-08 06:28:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3814935064935066) internal successors, (851), 637 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 851 transitions. [2025-03-08 06:28:32,161 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 851 transitions. Word has length 90 [2025-03-08 06:28:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 851 transitions. [2025-03-08 06:28:32,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 851 transitions. [2025-03-08 06:28:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:28:32,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:32,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:32,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:28:32,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:32,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2004335607, now seen corresponding path program 1 times [2025-03-08 06:28:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:32,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164035470] [2025-03-08 06:28:32,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:32,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:32,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:28:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:28:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164035470] [2025-03-08 06:28:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164035470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:28:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493942204] [2025-03-08 06:28:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:28:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:32,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:28:32,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:28:32,474 INFO L87 Difference]: Start difference. First operand 638 states and 851 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:33,299 INFO L93 Difference]: Finished difference Result 1201 states and 1560 transitions. [2025-03-08 06:28:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:28:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:28:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:33,302 INFO L225 Difference]: With dead ends: 1201 [2025-03-08 06:28:33,302 INFO L226 Difference]: Without dead ends: 855 [2025-03-08 06:28:33,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:28:33,303 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 3448 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3448 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:33,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3448 Valid, 1726 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-08 06:28:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 638. [2025-03-08 06:28:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37987012987013) internal successors, (850), 637 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 850 transitions. [2025-03-08 06:28:33,311 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 850 transitions. Word has length 90 [2025-03-08 06:28:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:33,312 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 850 transitions. [2025-03-08 06:28:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 850 transitions. [2025-03-08 06:28:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:28:33,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:33,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:33,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:28:33,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1435763157, now seen corresponding path program 1 times [2025-03-08 06:28:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669256287] [2025-03-08 06:28:33,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:33,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:28:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:28:33,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:33,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669256287] [2025-03-08 06:28:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669256287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328662246] [2025-03-08 06:28:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:33,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:33,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:33,711 INFO L87 Difference]: Start difference. First operand 638 states and 850 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:34,793 INFO L93 Difference]: Finished difference Result 1179 states and 1590 transitions. [2025-03-08 06:28:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:34,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:28:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:34,796 INFO L225 Difference]: With dead ends: 1179 [2025-03-08 06:28:34,796 INFO L226 Difference]: Without dead ends: 987 [2025-03-08 06:28:34,797 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-08 06:28:34,797 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 3442 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:34,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 3632 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-08 06:28:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 638. [2025-03-08 06:28:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3782467532467533) internal successors, (849), 637 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 849 transitions. [2025-03-08 06:28:34,808 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 849 transitions. Word has length 90 [2025-03-08 06:28:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:34,808 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 849 transitions. [2025-03-08 06:28:34,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 849 transitions. [2025-03-08 06:28:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:28:34,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:34,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:34,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:28:34,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1149666633, now seen corresponding path program 1 times [2025-03-08 06:28:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319606814] [2025-03-08 06:28:34,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:34,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:28:34,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:28:34,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:35,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319606814] [2025-03-08 06:28:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319606814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:35,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:35,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921021092] [2025-03-08 06:28:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:35,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:35,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:35,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:35,039 INFO L87 Difference]: Start difference. First operand 638 states and 849 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:35,825 INFO L93 Difference]: Finished difference Result 1074 states and 1439 transitions. [2025-03-08 06:28:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 06:28:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:35,828 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 06:28:35,828 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:35,829 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-08 06:28:35,829 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 2208 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:35,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2051 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:28:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3766233766233766) internal successors, (848), 637 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 848 transitions. [2025-03-08 06:28:35,837 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 848 transitions. Word has length 90 [2025-03-08 06:28:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 848 transitions. [2025-03-08 06:28:35,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 848 transitions. [2025-03-08 06:28:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:35,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:35,839 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] [2025-03-08 06:28:35,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:28:35,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1935630246, now seen corresponding path program 1 times [2025-03-08 06:28:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699296038] [2025-03-08 06:28:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:35,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:35,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:35,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:35,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699296038] [2025-03-08 06:28:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699296038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277771931] [2025-03-08 06:28:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:36,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:36,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:36,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:36,131 INFO L87 Difference]: Start difference. First operand 638 states and 848 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:37,224 INFO L93 Difference]: Finished difference Result 1140 states and 1524 transitions. [2025-03-08 06:28:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:28:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:37,227 INFO L225 Difference]: With dead ends: 1140 [2025-03-08 06:28:37,227 INFO L226 Difference]: Without dead ends: 987 [2025-03-08 06:28:37,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:28:37,230 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3172 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3172 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:37,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3172 Valid, 3259 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-08 06:28:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 641. [2025-03-08 06:28:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3747980613893376) internal successors, (851), 640 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 851 transitions. [2025-03-08 06:28:37,252 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 851 transitions. Word has length 92 [2025-03-08 06:28:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 851 transitions. [2025-03-08 06:28:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 851 transitions. [2025-03-08 06:28:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:37,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:37,255 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] [2025-03-08 06:28:37,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:28:37,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:37,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1924025231, now seen corresponding path program 1 times [2025-03-08 06:28:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424392635] [2025-03-08 06:28:37,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:37,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:37,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:37,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424392635] [2025-03-08 06:28:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424392635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939897145] [2025-03-08 06:28:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:37,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:37,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:37,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:37,518 INFO L87 Difference]: Start difference. First operand 641 states and 851 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:38,497 INFO L93 Difference]: Finished difference Result 1209 states and 1613 transitions. [2025-03-08 06:28:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:38,500 INFO L225 Difference]: With dead ends: 1209 [2025-03-08 06:28:38,500 INFO L226 Difference]: Without dead ends: 987 [2025-03-08 06:28:38,501 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-08 06:28:38,501 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1841 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 2880 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-08 06:28:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 638. [2025-03-08 06:28:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.375) internal successors, (847), 637 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 847 transitions. [2025-03-08 06:28:38,511 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 847 transitions. Word has length 92 [2025-03-08 06:28:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:38,511 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 847 transitions. [2025-03-08 06:28:38,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 847 transitions. [2025-03-08 06:28:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:38,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:38,513 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] [2025-03-08 06:28:38,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:28:38,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:38,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash 873540977, now seen corresponding path program 1 times [2025-03-08 06:28:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517387516] [2025-03-08 06:28:38,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:38,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:38,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:38,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517387516] [2025-03-08 06:28:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517387516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449547346] [2025-03-08 06:28:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:38,771 INFO L87 Difference]: Start difference. First operand 638 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:39,811 INFO L93 Difference]: Finished difference Result 1120 states and 1502 transitions. [2025-03-08 06:28:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:39,813 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 06:28:39,813 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 06:28:39,814 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-08 06:28:39,814 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 2590 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:39,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 3657 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 06:28:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-03-08 06:28:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3733766233766234) internal successors, (846), 637 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 846 transitions. [2025-03-08 06:28:39,824 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 846 transitions. Word has length 92 [2025-03-08 06:28:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:39,825 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 846 transitions. [2025-03-08 06:28:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 846 transitions. [2025-03-08 06:28:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:39,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:39,826 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] [2025-03-08 06:28:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:28:39,826 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 519089657, now seen corresponding path program 1 times [2025-03-08 06:28:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040859670] [2025-03-08 06:28:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:39,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:39,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:39,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:39,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040859670] [2025-03-08 06:28:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040859670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455933244] [2025-03-08 06:28:40,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:40,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:40,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:40,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:40,003 INFO L87 Difference]: Start difference. First operand 638 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:40,872 INFO L93 Difference]: Finished difference Result 1074 states and 1435 transitions. [2025-03-08 06:28:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:40,876 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 06:28:40,876 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:40,876 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-08 06:28:40,877 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 2954 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2954 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:40,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2954 Valid, 2497 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:28:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3717532467532467) internal successors, (845), 637 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 845 transitions. [2025-03-08 06:28:40,884 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 845 transitions. Word has length 92 [2025-03-08 06:28:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:40,884 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 845 transitions. [2025-03-08 06:28:40,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 845 transitions. [2025-03-08 06:28:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:40,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:40,886 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] [2025-03-08 06:28:40,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:28:40,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -565292661, now seen corresponding path program 1 times [2025-03-08 06:28:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130012344] [2025-03-08 06:28:40,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:40,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:40,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130012344] [2025-03-08 06:28:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130012344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007562340] [2025-03-08 06:28:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:41,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:41,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:41,073 INFO L87 Difference]: Start difference. First operand 638 states and 845 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:41,895 INFO L93 Difference]: Finished difference Result 1120 states and 1503 transitions. [2025-03-08 06:28:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:41,898 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 06:28:41,898 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 06:28:41,898 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-08 06:28:41,898 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 2595 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:41,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 3077 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 06:28:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-03-08 06:28:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37012987012987) internal successors, (844), 637 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 844 transitions. [2025-03-08 06:28:41,904 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 844 transitions. Word has length 92 [2025-03-08 06:28:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:41,905 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 844 transitions. [2025-03-08 06:28:41,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 844 transitions. [2025-03-08 06:28:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:41,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:41,906 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] [2025-03-08 06:28:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:28:41,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -537578646, now seen corresponding path program 1 times [2025-03-08 06:28:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84856725] [2025-03-08 06:28:41,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:41,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:41,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84856725] [2025-03-08 06:28:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84856725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:42,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:42,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742997443] [2025-03-08 06:28:42,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:42,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:42,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:42,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:42,082 INFO L87 Difference]: Start difference. First operand 638 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:42,780 INFO L93 Difference]: Finished difference Result 1006 states and 1323 transitions. [2025-03-08 06:28:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:42,783 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 06:28:42,783 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:42,783 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-08 06:28:42,784 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2291 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:42,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 1865 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 638. [2025-03-08 06:28:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3685064935064934) internal successors, (843), 637 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 843 transitions. [2025-03-08 06:28:42,791 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 843 transitions. Word has length 92 [2025-03-08 06:28:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:42,791 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 843 transitions. [2025-03-08 06:28:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 843 transitions. [2025-03-08 06:28:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:42,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:42,793 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] [2025-03-08 06:28:42,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:28:42,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:42,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash -202173863, now seen corresponding path program 1 times [2025-03-08 06:28:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984061908] [2025-03-08 06:28:42,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:42,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:42,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:42,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984061908] [2025-03-08 06:28:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984061908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943567857] [2025-03-08 06:28:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:42,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:42,969 INFO L87 Difference]: Start difference. First operand 638 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:43,918 INFO L93 Difference]: Finished difference Result 1106 states and 1484 transitions. [2025-03-08 06:28:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:43,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:43,921 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 06:28:43,921 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 06:28:43,922 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-08 06:28:43,922 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3680 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3680 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:43,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3680 Valid, 2906 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 06:28:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-03-08 06:28:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3668831168831168) internal successors, (842), 637 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 842 transitions. [2025-03-08 06:28:43,927 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 842 transitions. Word has length 92 [2025-03-08 06:28:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:43,928 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 842 transitions. [2025-03-08 06:28:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 842 transitions. [2025-03-08 06:28:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:28:43,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:43,929 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] [2025-03-08 06:28:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:28:43,929 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:43,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 82588328, now seen corresponding path program 1 times [2025-03-08 06:28:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029352237] [2025-03-08 06:28:43,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:43,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:28:43,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:28:43,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:44,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029352237] [2025-03-08 06:28:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029352237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412658565] [2025-03-08 06:28:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:44,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:44,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:44,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:44,109 INFO L87 Difference]: Start difference. First operand 638 states and 842 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:44,836 INFO L93 Difference]: Finished difference Result 1069 states and 1427 transitions. [2025-03-08 06:28:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:44,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:28:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:44,839 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 06:28:44,839 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:44,839 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-08 06:28:44,840 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 4033 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4033 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:44,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4033 Valid, 2570 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:28:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 637 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 841 transitions. [2025-03-08 06:28:44,845 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 841 transitions. Word has length 92 [2025-03-08 06:28:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:44,845 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 841 transitions. [2025-03-08 06:28:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 841 transitions. [2025-03-08 06:28:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:44,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:44,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:28:44,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:44,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:44,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1380036454, now seen corresponding path program 1 times [2025-03-08 06:28:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:44,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328973312] [2025-03-08 06:28:44,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:44,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:44,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:44,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:44,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328973312] [2025-03-08 06:28:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328973312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:45,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:45,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873865764] [2025-03-08 06:28:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:45,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:45,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:45,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:45,003 INFO L87 Difference]: Start difference. First operand 638 states and 841 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:45,901 INFO L93 Difference]: Finished difference Result 1135 states and 1509 transitions. [2025-03-08 06:28:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:45,904 INFO L225 Difference]: With dead ends: 1135 [2025-03-08 06:28:45,904 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 06:28:45,904 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-08 06:28:45,905 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 3390 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:45,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 3077 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 06:28:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-03-08 06:28:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3636363636363635) internal successors, (840), 637 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 840 transitions. [2025-03-08 06:28:45,911 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 840 transitions. Word has length 94 [2025-03-08 06:28:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 840 transitions. [2025-03-08 06:28:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 840 transitions. [2025-03-08 06:28:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:45,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:45,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:45,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:28:45,912 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1815348273, now seen corresponding path program 1 times [2025-03-08 06:28:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204147186] [2025-03-08 06:28:45,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:45,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:45,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:46,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204147186] [2025-03-08 06:28:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204147186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:46,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:46,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708054896] [2025-03-08 06:28:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:46,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:46,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:46,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:46,114 INFO L87 Difference]: Start difference. First operand 638 states and 840 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:46,928 INFO L93 Difference]: Finished difference Result 1083 states and 1438 transitions. [2025-03-08 06:28:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:46,931 INFO L225 Difference]: With dead ends: 1083 [2025-03-08 06:28:46,931 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:46,931 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-08 06:28:46,931 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 3733 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3733 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:46,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3733 Valid, 2814 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:28:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3620129870129871) internal successors, (839), 637 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 839 transitions. [2025-03-08 06:28:46,938 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 839 transitions. Word has length 94 [2025-03-08 06:28:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:46,938 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 839 transitions. [2025-03-08 06:28:46,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 839 transitions. [2025-03-08 06:28:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:46,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:46,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:46,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:28:46,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2032479125, now seen corresponding path program 1 times [2025-03-08 06:28:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033284213] [2025-03-08 06:28:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:46,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:46,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:46,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:46,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033284213] [2025-03-08 06:28:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033284213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:47,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:47,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:47,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221933519] [2025-03-08 06:28:47,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:47,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:47,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:47,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:47,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:47,136 INFO L87 Difference]: Start difference. First operand 638 states and 839 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:47,957 INFO L93 Difference]: Finished difference Result 1045 states and 1383 transitions. [2025-03-08 06:28:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:47,960 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:28:47,960 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:47,960 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-08 06:28:47,961 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 3657 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3657 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:47,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3657 Valid, 2908 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-03-08 06:28:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3603896103896105) internal successors, (838), 637 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 838 transitions. [2025-03-08 06:28:47,967 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 838 transitions. Word has length 94 [2025-03-08 06:28:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:47,967 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 838 transitions. [2025-03-08 06:28:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 838 transitions. [2025-03-08 06:28:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:47,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:47,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:47,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:28:47,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:47,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 137644418, now seen corresponding path program 1 times [2025-03-08 06:28:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063314479] [2025-03-08 06:28:47,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:47,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:47,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063314479] [2025-03-08 06:28:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063314479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133689880] [2025-03-08 06:28:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:48,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:48,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:48,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:48,160 INFO L87 Difference]: Start difference. First operand 638 states and 838 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:49,036 INFO L93 Difference]: Finished difference Result 1083 states and 1434 transitions. [2025-03-08 06:28:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:49,039 INFO L225 Difference]: With dead ends: 1083 [2025-03-08 06:28:49,039 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:49,039 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-08 06:28:49,040 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 2674 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:49,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3316 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:28:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3587662337662338) internal successors, (837), 637 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 837 transitions. [2025-03-08 06:28:49,046 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 837 transitions. Word has length 94 [2025-03-08 06:28:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:49,046 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 837 transitions. [2025-03-08 06:28:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 837 transitions. [2025-03-08 06:28:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:49,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:49,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:28:49,048 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1748613512, now seen corresponding path program 1 times [2025-03-08 06:28:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889311779] [2025-03-08 06:28:49,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:49,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:49,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:49,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:49,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889311779] [2025-03-08 06:28:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889311779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393254815] [2025-03-08 06:28:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:49,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:49,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:49,254 INFO L87 Difference]: Start difference. First operand 638 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:49,960 INFO L93 Difference]: Finished difference Result 1045 states and 1380 transitions. [2025-03-08 06:28:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:49,963 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:28:49,963 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:49,963 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-08 06:28:49,964 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 3568 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3568 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:49,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3568 Valid, 2517 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-03-08 06:28:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3571428571428572) internal successors, (836), 637 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 836 transitions. [2025-03-08 06:28:49,969 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 836 transitions. Word has length 94 [2025-03-08 06:28:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:49,969 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 836 transitions. [2025-03-08 06:28:49,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 836 transitions. [2025-03-08 06:28:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:49,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:49,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:49,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:28:49,970 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:49,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1126271269, now seen corresponding path program 1 times [2025-03-08 06:28:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:49,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929528564] [2025-03-08 06:28:49,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:49,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:50,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:50,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929528564] [2025-03-08 06:28:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929528564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:50,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629919272] [2025-03-08 06:28:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:50,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:50,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:50,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:50,144 INFO L87 Difference]: Start difference. First operand 638 states and 836 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:50,953 INFO L93 Difference]: Finished difference Result 1045 states and 1379 transitions. [2025-03-08 06:28:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:50,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:50,956 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:28:50,956 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:50,956 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-08 06:28:50,956 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2970 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2970 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:50,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2970 Valid, 2496 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-03-08 06:28:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3555194805194806) internal successors, (835), 637 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 835 transitions. [2025-03-08 06:28:50,962 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 835 transitions. Word has length 94 [2025-03-08 06:28:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 835 transitions. [2025-03-08 06:28:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 835 transitions. [2025-03-08 06:28:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:50,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:50,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:50,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:28:50,963 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2048964979, now seen corresponding path program 1 times [2025-03-08 06:28:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069513177] [2025-03-08 06:28:50,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:50,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:50,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:50,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:50,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069513177] [2025-03-08 06:28:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069513177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184506505] [2025-03-08 06:28:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:51,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:51,127 INFO L87 Difference]: Start difference. First operand 638 states and 835 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:51,765 INFO L93 Difference]: Finished difference Result 1003 states and 1310 transitions. [2025-03-08 06:28:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:51,768 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 06:28:51,768 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:51,768 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-08 06:28:51,768 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 3295 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:51,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 1965 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 638. [2025-03-08 06:28:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.353896103896104) internal successors, (834), 637 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 834 transitions. [2025-03-08 06:28:51,774 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 834 transitions. Word has length 94 [2025-03-08 06:28:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:51,774 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 834 transitions. [2025-03-08 06:28:51,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 834 transitions. [2025-03-08 06:28:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:51,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:51,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:28:51,775 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1182169636, now seen corresponding path program 1 times [2025-03-08 06:28:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50761335] [2025-03-08 06:28:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50761335] [2025-03-08 06:28:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50761335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385913199] [2025-03-08 06:28:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:51,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:51,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:51,966 INFO L87 Difference]: Start difference. First operand 638 states and 834 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:52,697 INFO L93 Difference]: Finished difference Result 1050 states and 1381 transitions. [2025-03-08 06:28:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:52,700 INFO L225 Difference]: With dead ends: 1050 [2025-03-08 06:28:52,700 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:52,700 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-08 06:28:52,700 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1964 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:52,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 2508 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-03-08 06:28:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3522727272727273) internal successors, (833), 637 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 833 transitions. [2025-03-08 06:28:52,706 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 833 transitions. Word has length 94 [2025-03-08 06:28:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 833 transitions. [2025-03-08 06:28:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 833 transitions. [2025-03-08 06:28:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:52,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:52,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:28:52,707 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 125302526, now seen corresponding path program 1 times [2025-03-08 06:28:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084683191] [2025-03-08 06:28:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:52,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084683191] [2025-03-08 06:28:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084683191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:52,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922397716] [2025-03-08 06:28:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:52,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:52,998 INFO L87 Difference]: Start difference. First operand 638 states and 833 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:54,353 INFO L93 Difference]: Finished difference Result 1345 states and 1813 transitions. [2025-03-08 06:28:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:28:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:54,356 INFO L225 Difference]: With dead ends: 1345 [2025-03-08 06:28:54,356 INFO L226 Difference]: Without dead ends: 1237 [2025-03-08 06:28:54,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:28:54,357 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 5064 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5064 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:54,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5064 Valid, 3533 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:28:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-08 06:28:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 642. [2025-03-08 06:28:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.35) internal successors, (837), 641 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 837 transitions. [2025-03-08 06:28:54,363 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 837 transitions. Word has length 94 [2025-03-08 06:28:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:54,363 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 837 transitions. [2025-03-08 06:28:54,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 837 transitions. [2025-03-08 06:28:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:54,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:54,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:54,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:28:54,364 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash -974844295, now seen corresponding path program 1 times [2025-03-08 06:28:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274235600] [2025-03-08 06:28:54,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:54,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274235600] [2025-03-08 06:28:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274235600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162290688] [2025-03-08 06:28:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:54,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:54,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:54,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:54,547 INFO L87 Difference]: Start difference. First operand 642 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:55,380 INFO L93 Difference]: Finished difference Result 1049 states and 1379 transitions. [2025-03-08 06:28:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:55,382 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 06:28:55,382 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:28:55,382 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-08 06:28:55,383 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3590 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:55,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3590 Valid, 3004 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:28:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-03-08 06:28:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3483870967741935) internal successors, (836), 641 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 836 transitions. [2025-03-08 06:28:55,390 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 836 transitions. Word has length 94 [2025-03-08 06:28:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 836 transitions. [2025-03-08 06:28:55,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 836 transitions. [2025-03-08 06:28:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:55,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:55,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:55,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:28:55,391 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:55,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1371188463, now seen corresponding path program 1 times [2025-03-08 06:28:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:55,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397758925] [2025-03-08 06:28:55,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:55,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:55,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397758925] [2025-03-08 06:28:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397758925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:55,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:55,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:55,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072200772] [2025-03-08 06:28:55,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:55,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:55,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:55,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:55,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:55,555 INFO L87 Difference]: Start difference. First operand 642 states and 836 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:56,296 INFO L93 Difference]: Finished difference Result 1074 states and 1416 transitions. [2025-03-08 06:28:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:56,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:56,298 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 06:28:56,299 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:28:56,299 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-08 06:28:56,299 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 3825 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:56,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 2710 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:28:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 642. [2025-03-08 06:28:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.346774193548387) internal successors, (835), 641 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 835 transitions. [2025-03-08 06:28:56,306 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 835 transitions. Word has length 94 [2025-03-08 06:28:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 835 transitions. [2025-03-08 06:28:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 835 transitions. [2025-03-08 06:28:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:56,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:56,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:28:56,307 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:56,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2038755885, now seen corresponding path program 1 times [2025-03-08 06:28:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049881696] [2025-03-08 06:28:56,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:56,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:56,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049881696] [2025-03-08 06:28:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049881696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210677444] [2025-03-08 06:28:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:56,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:56,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:56,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:56,484 INFO L87 Difference]: Start difference. First operand 642 states and 835 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:57,347 INFO L93 Difference]: Finished difference Result 1045 states and 1373 transitions. [2025-03-08 06:28:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:57,349 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:28:57,349 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:28:57,350 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-08 06:28:57,350 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 3548 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3548 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:57,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3548 Valid, 3080 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:28:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-03-08 06:28:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3451612903225807) internal successors, (834), 641 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 834 transitions. [2025-03-08 06:28:57,357 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 834 transitions. Word has length 94 [2025-03-08 06:28:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:57,358 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 834 transitions. [2025-03-08 06:28:57,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 834 transitions. [2025-03-08 06:28:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:57,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:57,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:57,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:28:57,359 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:57,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1714822152, now seen corresponding path program 1 times [2025-03-08 06:28:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:57,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436339503] [2025-03-08 06:28:57,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:57,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:57,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:57,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436339503] [2025-03-08 06:28:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436339503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315150700] [2025-03-08 06:28:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:57,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:57,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:57,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:57,525 INFO L87 Difference]: Start difference. First operand 642 states and 834 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:58,272 INFO L93 Difference]: Finished difference Result 1049 states and 1375 transitions. [2025-03-08 06:28:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:58,273 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 06:28:58,273 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:28:58,274 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-08 06:28:58,274 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2882 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2882 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:58,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2882 Valid, 2572 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:28:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-03-08 06:28:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3435483870967742) internal successors, (833), 641 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2025-03-08 06:28:58,279 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 94 [2025-03-08 06:28:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:58,279 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2025-03-08 06:28:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2025-03-08 06:28:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:58,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:58,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:28:58,281 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:58,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash -766706055, now seen corresponding path program 1 times [2025-03-08 06:28:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370137549] [2025-03-08 06:28:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:58,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:58,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:58,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:58,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370137549] [2025-03-08 06:28:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370137549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:58,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969475237] [2025-03-08 06:28:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:58,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:58,448 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:59,298 INFO L93 Difference]: Finished difference Result 1045 states and 1370 transitions. [2025-03-08 06:28:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:59,300 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:28:59,300 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:28:59,300 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-08 06:28:59,301 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 3442 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:59,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 3298 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:28:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-03-08 06:28:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3419354838709678) internal successors, (832), 641 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2025-03-08 06:28:59,313 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 94 [2025-03-08 06:28:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:59,313 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2025-03-08 06:28:59,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2025-03-08 06:28:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:59,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:59,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:59,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:28:59,314 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:59,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash -424007258, now seen corresponding path program 1 times [2025-03-08 06:28:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:59,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226962347] [2025-03-08 06:28:59,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:59,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:59,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226962347] [2025-03-08 06:28:59,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226962347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:59,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:59,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744816318] [2025-03-08 06:28:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:59,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:59,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:59,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:59,473 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:00,200 INFO L93 Difference]: Finished difference Result 1045 states and 1369 transitions. [2025-03-08 06:29:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:00,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:29:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:00,202 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:29:00,202 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:29:00,202 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-08 06:29:00,203 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2877 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:00,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2877 Valid, 2572 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:29:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-03-08 06:29:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3403225806451613) internal successors, (831), 641 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 831 transitions. [2025-03-08 06:29:00,208 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 831 transitions. Word has length 94 [2025-03-08 06:29:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:00,208 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 831 transitions. [2025-03-08 06:29:00,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 831 transitions. [2025-03-08 06:29:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:29:00,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:00,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:00,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:29:00,209 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:00,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1104587278, now seen corresponding path program 1 times [2025-03-08 06:29:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017910282] [2025-03-08 06:29:00,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:00,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:29:00,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:29:00,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:00,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017910282] [2025-03-08 06:29:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017910282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740358084] [2025-03-08 06:29:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:00,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:00,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:00,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:00,430 INFO L87 Difference]: Start difference. First operand 642 states and 831 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:01,181 INFO L93 Difference]: Finished difference Result 1083 states and 1417 transitions. [2025-03-08 06:29:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:29:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:01,186 INFO L225 Difference]: With dead ends: 1083 [2025-03-08 06:29:01,186 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:29:01,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:01,187 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 3678 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3678 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:01,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3678 Valid, 2799 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:29:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-03-08 06:29:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 637 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 826 transitions. [2025-03-08 06:29:01,193 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 826 transitions. Word has length 95 [2025-03-08 06:29:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:01,193 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 826 transitions. [2025-03-08 06:29:01,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 826 transitions. [2025-03-08 06:29:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:29:01,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:01,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:29:01,195 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1491027213, now seen corresponding path program 1 times [2025-03-08 06:29:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750794195] [2025-03-08 06:29:01,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:01,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:29:01,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:29:01,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:01,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750794195] [2025-03-08 06:29:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750794195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81928861] [2025-03-08 06:29:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:01,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:01,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:01,378 INFO L87 Difference]: Start difference. First operand 638 states and 826 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:02,227 INFO L93 Difference]: Finished difference Result 1040 states and 1361 transitions. [2025-03-08 06:29:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:29:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:02,229 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 06:29:02,229 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:29:02,229 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-08 06:29:02,229 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 3392 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3392 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:02,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3392 Valid, 3386 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:29:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-03-08 06:29:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3392857142857142) internal successors, (825), 637 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 825 transitions. [2025-03-08 06:29:02,234 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 825 transitions. Word has length 95 [2025-03-08 06:29:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:02,234 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 825 transitions. [2025-03-08 06:29:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 825 transitions. [2025-03-08 06:29:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:02,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:02,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:02,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:29:02,235 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash -781771315, now seen corresponding path program 1 times [2025-03-08 06:29:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384349982] [2025-03-08 06:29:02,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:02,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:02,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384349982] [2025-03-08 06:29:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384349982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684020132] [2025-03-08 06:29:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:02,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:02,480 INFO L87 Difference]: Start difference. First operand 638 states and 825 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:03,649 INFO L93 Difference]: Finished difference Result 1272 states and 1695 transitions. [2025-03-08 06:29:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:03,651 INFO L225 Difference]: With dead ends: 1272 [2025-03-08 06:29:03,651 INFO L226 Difference]: Without dead ends: 1181 [2025-03-08 06:29:03,652 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-08 06:29:03,653 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 5975 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5975 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:03,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5975 Valid, 3050 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-08 06:29:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 642. [2025-03-08 06:29:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3370967741935484) internal successors, (829), 641 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 829 transitions. [2025-03-08 06:29:03,662 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 829 transitions. Word has length 96 [2025-03-08 06:29:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:03,663 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 829 transitions. [2025-03-08 06:29:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 829 transitions. [2025-03-08 06:29:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:03,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:03,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:03,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:29:03,664 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:03,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1550497711, now seen corresponding path program 1 times [2025-03-08 06:29:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586321937] [2025-03-08 06:29:03,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:03,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:03,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:03,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586321937] [2025-03-08 06:29:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586321937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603277229] [2025-03-08 06:29:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:03,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:03,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:03,844 INFO L87 Difference]: Start difference. First operand 642 states and 829 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:04,538 INFO L93 Difference]: Finished difference Result 1010 states and 1306 transitions. [2025-03-08 06:29:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:04,539 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 06:29:04,539 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:04,540 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-08 06:29:04,540 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1992 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:04,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 2358 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.335483870967742) internal successors, (828), 641 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 828 transitions. [2025-03-08 06:29:04,547 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 828 transitions. Word has length 96 [2025-03-08 06:29:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:04,547 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 828 transitions. [2025-03-08 06:29:04,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 828 transitions. [2025-03-08 06:29:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:04,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:04,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:29:04,548 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:04,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1225873890, now seen corresponding path program 1 times [2025-03-08 06:29:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:04,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961941814] [2025-03-08 06:29:04,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:04,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:04,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961941814] [2025-03-08 06:29:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961941814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35750462] [2025-03-08 06:29:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:04,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:04,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:04,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:04,709 INFO L87 Difference]: Start difference. First operand 642 states and 828 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:05,394 INFO L93 Difference]: Finished difference Result 1010 states and 1305 transitions. [2025-03-08 06:29:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:05,396 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 06:29:05,396 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:05,397 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-08 06:29:05,397 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2889 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:05,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 2602 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3338709677419356) internal successors, (827), 641 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 827 transitions. [2025-03-08 06:29:05,404 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 827 transitions. Word has length 96 [2025-03-08 06:29:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:05,404 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 827 transitions. [2025-03-08 06:29:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 827 transitions. [2025-03-08 06:29:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:05,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:05,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:29:05,405 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1121539455, now seen corresponding path program 1 times [2025-03-08 06:29:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358350963] [2025-03-08 06:29:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:05,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:05,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:05,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358350963] [2025-03-08 06:29:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358350963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:05,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:05,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220436323] [2025-03-08 06:29:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:05,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:05,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:05,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:05,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:05,615 INFO L87 Difference]: Start difference. First operand 642 states and 827 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:06,324 INFO L93 Difference]: Finished difference Result 1007 states and 1300 transitions. [2025-03-08 06:29:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:06,326 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:06,326 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:06,326 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-08 06:29:06,326 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 4127 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4127 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:06,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4127 Valid, 2168 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.332258064516129) internal successors, (826), 641 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 826 transitions. [2025-03-08 06:29:06,333 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 826 transitions. Word has length 96 [2025-03-08 06:29:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:06,333 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 826 transitions. [2025-03-08 06:29:06,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2025-03-08 06:29:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:06,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:06,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:29:06,334 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2077132105, now seen corresponding path program 1 times [2025-03-08 06:29:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646714960] [2025-03-08 06:29:06,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:06,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:06,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:06,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646714960] [2025-03-08 06:29:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646714960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132834484] [2025-03-08 06:29:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:06,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:06,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:06,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:06,512 INFO L87 Difference]: Start difference. First operand 642 states and 826 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:07,265 INFO L93 Difference]: Finished difference Result 1050 states and 1364 transitions. [2025-03-08 06:29:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:07,267 INFO L225 Difference]: With dead ends: 1050 [2025-03-08 06:29:07,267 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:29:07,268 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-08 06:29:07,268 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3486 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:07,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 3132 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:29:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-03-08 06:29:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3306451612903225) internal successors, (825), 641 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 825 transitions. [2025-03-08 06:29:07,272 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 825 transitions. Word has length 96 [2025-03-08 06:29:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 825 transitions. [2025-03-08 06:29:07,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 825 transitions. [2025-03-08 06:29:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:07,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:07,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:07,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:29:07,273 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:07,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 114433835, now seen corresponding path program 1 times [2025-03-08 06:29:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799567179] [2025-03-08 06:29:07,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:07,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:07,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:07,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:07,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:07,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:07,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799567179] [2025-03-08 06:29:07,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799567179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:07,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43927557] [2025-03-08 06:29:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:07,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:07,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:07,437 INFO L87 Difference]: Start difference. First operand 642 states and 825 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:08,110 INFO L93 Difference]: Finished difference Result 1010 states and 1301 transitions. [2025-03-08 06:29:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:08,112 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 06:29:08,112 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:08,113 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-08 06:29:08,113 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4001 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:08,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 2224 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3290322580645162) internal successors, (824), 641 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 824 transitions. [2025-03-08 06:29:08,118 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 824 transitions. Word has length 96 [2025-03-08 06:29:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:08,118 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 824 transitions. [2025-03-08 06:29:08,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 824 transitions. [2025-03-08 06:29:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:08,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:08,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:08,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:29:08,118 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -692269888, now seen corresponding path program 1 times [2025-03-08 06:29:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:08,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096100320] [2025-03-08 06:29:08,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:08,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:08,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:08,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:08,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:08,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:08,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096100320] [2025-03-08 06:29:08,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096100320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:08,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849666813] [2025-03-08 06:29:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:08,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:08,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:08,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:08,290 INFO L87 Difference]: Start difference. First operand 642 states and 824 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,040 INFO L93 Difference]: Finished difference Result 976 states and 1251 transitions. [2025-03-08 06:29:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,042 INFO L225 Difference]: With dead ends: 976 [2025-03-08 06:29:09,042 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:29:09,042 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-08 06:29:09,043 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 1874 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 2624 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:29:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-03-08 06:29:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3274193548387097) internal successors, (823), 641 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2025-03-08 06:29:09,048 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 96 [2025-03-08 06:29:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,048 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2025-03-08 06:29:09,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2025-03-08 06:29:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:09,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:29:09,049 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1639999138, now seen corresponding path program 1 times [2025-03-08 06:29:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390195491] [2025-03-08 06:29:09,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390195491] [2025-03-08 06:29:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390195491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400609211] [2025-03-08 06:29:09,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:09,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:09,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:09,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:09,204 INFO L87 Difference]: Start difference. First operand 642 states and 823 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,822 INFO L93 Difference]: Finished difference Result 936 states and 1188 transitions. [2025-03-08 06:29:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:09,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,824 INFO L225 Difference]: With dead ends: 936 [2025-03-08 06:29:09,824 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:09,825 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-08 06:29:09,825 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 3577 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3577 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3577 Valid, 2278 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 641 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2025-03-08 06:29:09,833 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 96 [2025-03-08 06:29:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,833 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2025-03-08 06:29:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2025-03-08 06:29:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:09,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:29:09,834 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -921482987, now seen corresponding path program 1 times [2025-03-08 06:29:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317841034] [2025-03-08 06:29:09,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:09,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:09,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317841034] [2025-03-08 06:29:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317841034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913429416] [2025-03-08 06:29:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:10,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:10,026 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,682 INFO L93 Difference]: Finished difference Result 936 states and 1187 transitions. [2025-03-08 06:29:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,684 INFO L225 Difference]: With dead ends: 936 [2025-03-08 06:29:10,684 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:10,685 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-08 06:29:10,685 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 2964 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 2257 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3241935483870968) internal successors, (821), 641 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 821 transitions. [2025-03-08 06:29:10,689 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 821 transitions. Word has length 96 [2025-03-08 06:29:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,689 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 821 transitions. [2025-03-08 06:29:10,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 821 transitions. [2025-03-08 06:29:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:29:10,690 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:10,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 111700676, now seen corresponding path program 1 times [2025-03-08 06:29:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103671842] [2025-03-08 06:29:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:10,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103671842] [2025-03-08 06:29:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103671842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659831602] [2025-03-08 06:29:10,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:10,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:10,922 INFO L87 Difference]: Start difference. First operand 642 states and 821 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,599 INFO L93 Difference]: Finished difference Result 1007 states and 1293 transitions. [2025-03-08 06:29:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,601 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:11,601 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:11,602 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-08 06:29:11,602 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 3988 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3988 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3988 Valid, 2272 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3225806451612903) internal successors, (820), 641 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 820 transitions. [2025-03-08 06:29:11,608 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 820 transitions. Word has length 96 [2025-03-08 06:29:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,608 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 820 transitions. [2025-03-08 06:29:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 820 transitions. [2025-03-08 06:29:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:11,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:29:11,610 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2021814712, now seen corresponding path program 1 times [2025-03-08 06:29:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170547866] [2025-03-08 06:29:11,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:11,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170547866] [2025-03-08 06:29:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170547866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092169043] [2025-03-08 06:29:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:11,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:11,789 INFO L87 Difference]: Start difference. First operand 642 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:12,437 INFO L93 Difference]: Finished difference Result 936 states and 1184 transitions. [2025-03-08 06:29:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:12,439 INFO L225 Difference]: With dead ends: 936 [2025-03-08 06:29:12,439 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:12,440 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-08 06:29:12,440 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 3565 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3565 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:12,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3565 Valid, 2263 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.320967741935484) internal successors, (819), 641 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 819 transitions. [2025-03-08 06:29:12,446 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 819 transitions. Word has length 96 [2025-03-08 06:29:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 819 transitions. [2025-03-08 06:29:12,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 819 transitions. [2025-03-08 06:29:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:12,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:12,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:29:12,447 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -987746286, now seen corresponding path program 1 times [2025-03-08 06:29:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801552792] [2025-03-08 06:29:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:12,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:12,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:12,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801552792] [2025-03-08 06:29:12,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801552792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166098270] [2025-03-08 06:29:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:12,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:12,590 INFO L87 Difference]: Start difference. First operand 642 states and 819 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:13,210 INFO L93 Difference]: Finished difference Result 1007 states and 1290 transitions. [2025-03-08 06:29:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:13,212 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:13,212 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:13,212 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-08 06:29:13,213 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 3922 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3922 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:13,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3922 Valid, 2272 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3193548387096774) internal successors, (818), 641 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 818 transitions. [2025-03-08 06:29:13,217 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 818 transitions. Word has length 96 [2025-03-08 06:29:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,217 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 818 transitions. [2025-03-08 06:29:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 818 transitions. [2025-03-08 06:29:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:13,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:29:13,218 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:13,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1046235730, now seen corresponding path program 1 times [2025-03-08 06:29:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794652680] [2025-03-08 06:29:13,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:13,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:13,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794652680] [2025-03-08 06:29:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794652680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364294534] [2025-03-08 06:29:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:13,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:13,433 INFO L87 Difference]: Start difference. First operand 642 states and 818 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:14,233 INFO L93 Difference]: Finished difference Result 1041 states and 1343 transitions. [2025-03-08 06:29:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:14,235 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 06:29:14,235 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:29:14,235 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-08 06:29:14,235 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3456 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:14,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 3132 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:29:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-03-08 06:29:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3177419354838709) internal successors, (817), 641 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2025-03-08 06:29:14,240 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 96 [2025-03-08 06:29:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2025-03-08 06:29:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2025-03-08 06:29:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:14,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:14,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 06:29:14,242 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1593684681, now seen corresponding path program 1 times [2025-03-08 06:29:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306743398] [2025-03-08 06:29:14,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:14,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:14,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306743398] [2025-03-08 06:29:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306743398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840926575] [2025-03-08 06:29:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:14,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:14,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:14,418 INFO L87 Difference]: Start difference. First operand 642 states and 817 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,102 INFO L93 Difference]: Finished difference Result 1007 states and 1288 transitions. [2025-03-08 06:29:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,103 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:15,104 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:15,104 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-08 06:29:15,104 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 3660 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3660 Valid, 2474 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3161290322580645) internal successors, (816), 641 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 816 transitions. [2025-03-08 06:29:15,109 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 816 transitions. Word has length 96 [2025-03-08 06:29:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 816 transitions. [2025-03-08 06:29:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 816 transitions. [2025-03-08 06:29:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 06:29:15,111 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -834057870, now seen corresponding path program 1 times [2025-03-08 06:29:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592402292] [2025-03-08 06:29:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:15,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592402292] [2025-03-08 06:29:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592402292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323213275] [2025-03-08 06:29:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:15,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:15,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:15,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:15,282 INFO L87 Difference]: Start difference. First operand 642 states and 816 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,943 INFO L93 Difference]: Finished difference Result 1010 states and 1290 transitions. [2025-03-08 06:29:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:15,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,945 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 06:29:15,945 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:15,945 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-08 06:29:15,945 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 3333 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2277 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.314516129032258) internal successors, (815), 641 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 815 transitions. [2025-03-08 06:29:15,950 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 815 transitions. Word has length 96 [2025-03-08 06:29:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,950 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 815 transitions. [2025-03-08 06:29:15,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 815 transitions. [2025-03-08 06:29:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:15,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 06:29:15,951 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:15,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1890013096, now seen corresponding path program 1 times [2025-03-08 06:29:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961882273] [2025-03-08 06:29:15,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:15,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:15,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:16,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961882273] [2025-03-08 06:29:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961882273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853133673] [2025-03-08 06:29:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:16,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:16,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:16,125 INFO L87 Difference]: Start difference. First operand 642 states and 815 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:16,848 INFO L93 Difference]: Finished difference Result 1010 states and 1288 transitions. [2025-03-08 06:29:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:16,850 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 06:29:16,850 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:16,851 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-08 06:29:16,851 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2797 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2797 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:16,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2797 Valid, 2519 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3129032258064517) internal successors, (814), 641 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 814 transitions. [2025-03-08 06:29:16,856 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 814 transitions. Word has length 96 [2025-03-08 06:29:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:16,856 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 814 transitions. [2025-03-08 06:29:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 814 transitions. [2025-03-08 06:29:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:16,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:16,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] [2025-03-08 06:29:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 06:29:16,857 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 693597107, now seen corresponding path program 1 times [2025-03-08 06:29:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:16,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529243652] [2025-03-08 06:29:16,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:16,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:16,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:16,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:17,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529243652] [2025-03-08 06:29:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529243652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:17,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259461859] [2025-03-08 06:29:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:17,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:17,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:17,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:17,024 INFO L87 Difference]: Start difference. First operand 642 states and 814 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:17,667 INFO L93 Difference]: Finished difference Result 1007 states and 1284 transitions. [2025-03-08 06:29:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:17,670 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:17,670 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:17,670 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-08 06:29:17,670 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 3928 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:17,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3928 Valid, 2288 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-03-08 06:29:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3112903225806452) internal successors, (813), 641 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 813 transitions. [2025-03-08 06:29:17,677 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 813 transitions. Word has length 96 [2025-03-08 06:29:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 813 transitions. [2025-03-08 06:29:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 813 transitions. [2025-03-08 06:29:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:17,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:17,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:17,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 06:29:17,678 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:17,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -360139435, now seen corresponding path program 1 times [2025-03-08 06:29:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:17,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469339461] [2025-03-08 06:29:17,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:17,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:17,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:17,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469339461] [2025-03-08 06:29:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469339461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636984975] [2025-03-08 06:29:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:18,019 INFO L87 Difference]: Start difference. First operand 642 states and 813 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:19,170 INFO L93 Difference]: Finished difference Result 1267 states and 1666 transitions. [2025-03-08 06:29:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:19,171 INFO L225 Difference]: With dead ends: 1267 [2025-03-08 06:29:19,171 INFO L226 Difference]: Without dead ends: 1181 [2025-03-08 06:29:19,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:19,172 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 6854 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6854 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:19,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6854 Valid, 3355 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-08 06:29:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 646. [2025-03-08 06:29:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3092948717948718) internal successors, (817), 645 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 817 transitions. [2025-03-08 06:29:19,177 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 817 transitions. Word has length 96 [2025-03-08 06:29:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 817 transitions. [2025-03-08 06:29:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2025-03-08 06:29:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:19,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:19,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:19,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 06:29:19,178 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1402498976, now seen corresponding path program 1 times [2025-03-08 06:29:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025513375] [2025-03-08 06:29:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:19,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025513375] [2025-03-08 06:29:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025513375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506437465] [2025-03-08 06:29:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:19,337 INFO L87 Difference]: Start difference. First operand 646 states and 817 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:20,034 INFO L93 Difference]: Finished difference Result 1011 states and 1287 transitions. [2025-03-08 06:29:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:20,035 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 06:29:20,035 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:20,035 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-08 06:29:20,036 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 2792 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:20,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 2491 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 646. [2025-03-08 06:29:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3076923076923077) internal successors, (816), 645 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 816 transitions. [2025-03-08 06:29:20,040 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 816 transitions. Word has length 96 [2025-03-08 06:29:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:20,040 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 816 transitions. [2025-03-08 06:29:20,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 816 transitions. [2025-03-08 06:29:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:20,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:20,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 06:29:20,041 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:20,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 870586389, now seen corresponding path program 1 times [2025-03-08 06:29:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:20,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419839027] [2025-03-08 06:29:20,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:20,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419839027] [2025-03-08 06:29:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419839027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:20,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130670967] [2025-03-08 06:29:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:20,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:20,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:20,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:20,307 INFO L87 Difference]: Start difference. First operand 646 states and 816 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,357 INFO L93 Difference]: Finished difference Result 1122 states and 1443 transitions. [2025-03-08 06:29:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,359 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 06:29:21,359 INFO L226 Difference]: Without dead ends: 1117 [2025-03-08 06:29:21,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:21,360 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 7047 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7047 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:21,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7047 Valid, 2891 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-08 06:29:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 650. [2025-03-08 06:29:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.305732484076433) internal successors, (820), 649 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 820 transitions. [2025-03-08 06:29:21,365 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 820 transitions. Word has length 96 [2025-03-08 06:29:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:21,365 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 820 transitions. [2025-03-08 06:29:21,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 820 transitions. [2025-03-08 06:29:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:21,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 06:29:21,366 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1475862785, now seen corresponding path program 1 times [2025-03-08 06:29:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503007558] [2025-03-08 06:29:21,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:21,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:21,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:21,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:21,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503007558] [2025-03-08 06:29:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503007558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883037576] [2025-03-08 06:29:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:21,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:21,586 INFO L87 Difference]: Start difference. First operand 650 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,263 INFO L93 Difference]: Finished difference Result 1011 states and 1284 transitions. [2025-03-08 06:29:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,265 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 06:29:22,265 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:22,266 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-08 06:29:22,266 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 3640 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 2482 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 650. [2025-03-08 06:29:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3041401273885351) internal successors, (819), 649 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 819 transitions. [2025-03-08 06:29:22,272 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 819 transitions. Word has length 96 [2025-03-08 06:29:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,272 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 819 transitions. [2025-03-08 06:29:22,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 819 transitions. [2025-03-08 06:29:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:22,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 06:29:22,274 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:22,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 99877740, now seen corresponding path program 1 times [2025-03-08 06:29:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36023297] [2025-03-08 06:29:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:22,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:22,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36023297] [2025-03-08 06:29:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36023297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595968126] [2025-03-08 06:29:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:22,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:22,483 INFO L87 Difference]: Start difference. First operand 650 states and 819 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:23,231 INFO L93 Difference]: Finished difference Result 1011 states and 1283 transitions. [2025-03-08 06:29:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:23,233 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 06:29:23,233 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:23,233 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-08 06:29:23,233 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1904 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:23,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 2467 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 650. [2025-03-08 06:29:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.302547770700637) internal successors, (818), 649 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 818 transitions. [2025-03-08 06:29:23,238 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 818 transitions. Word has length 96 [2025-03-08 06:29:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:23,238 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 818 transitions. [2025-03-08 06:29:23,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 818 transitions. [2025-03-08 06:29:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:29:23,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:23,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 06:29:23,240 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2128461127, now seen corresponding path program 1 times [2025-03-08 06:29:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614124373] [2025-03-08 06:29:23,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:23,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:29:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:29:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614124373] [2025-03-08 06:29:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614124373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992294847] [2025-03-08 06:29:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:23,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:23,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:23,488 INFO L87 Difference]: Start difference. First operand 650 states and 818 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,569 INFO L93 Difference]: Finished difference Result 1193 states and 1547 transitions. [2025-03-08 06:29:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:24,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:29:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,571 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 06:29:24,571 INFO L226 Difference]: Without dead ends: 1117 [2025-03-08 06:29:24,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:24,572 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 7044 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7044 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7044 Valid, 2887 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-08 06:29:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 654. [2025-03-08 06:29:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3006329113924051) internal successors, (822), 653 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 822 transitions. [2025-03-08 06:29:24,576 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 822 transitions. Word has length 96 [2025-03-08 06:29:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,576 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 822 transitions. [2025-03-08 06:29:24,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 822 transitions. [2025-03-08 06:29:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:24,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,577 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] [2025-03-08 06:29:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 06:29:24,577 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2050996807, now seen corresponding path program 1 times [2025-03-08 06:29:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859216986] [2025-03-08 06:29:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:24,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:24,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859216986] [2025-03-08 06:29:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859216986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542987616] [2025-03-08 06:29:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:24,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:24,713 INFO L87 Difference]: Start difference. First operand 654 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:25,352 INFO L93 Difference]: Finished difference Result 1066 states and 1356 transitions. [2025-03-08 06:29:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:25,354 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 06:29:25,354 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 06:29:25,354 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-08 06:29:25,354 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 2752 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:25,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 2640 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 06:29:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 650. [2025-03-08 06:29:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3009554140127388) internal successors, (817), 649 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 817 transitions. [2025-03-08 06:29:25,359 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 817 transitions. Word has length 97 [2025-03-08 06:29:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:25,359 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 817 transitions. [2025-03-08 06:29:25,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 817 transitions. [2025-03-08 06:29:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:25,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:25,359 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] [2025-03-08 06:29:25,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 06:29:25,360 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2144208921, now seen corresponding path program 1 times [2025-03-08 06:29:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582594104] [2025-03-08 06:29:25,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:25,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:25,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:25,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582594104] [2025-03-08 06:29:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582594104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005564565] [2025-03-08 06:29:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:25,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:25,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:25,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:25,513 INFO L87 Difference]: Start difference. First operand 650 states and 817 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,174 INFO L93 Difference]: Finished difference Result 1005 states and 1273 transitions. [2025-03-08 06:29:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,176 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 06:29:26,176 INFO L226 Difference]: Without dead ends: 930 [2025-03-08 06:29:26,176 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-08 06:29:26,176 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 3864 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3864 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3864 Valid, 2324 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-08 06:29:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 649. [2025-03-08 06:29:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.2998405103668262) internal successors, (815), 648 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 815 transitions. [2025-03-08 06:29:26,184 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 815 transitions. Word has length 97 [2025-03-08 06:29:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,184 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 815 transitions. [2025-03-08 06:29:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 815 transitions. [2025-03-08 06:29:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:26,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,185 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] [2025-03-08 06:29:26,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 06:29:26,185 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 476420196, now seen corresponding path program 1 times [2025-03-08 06:29:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328880471] [2025-03-08 06:29:26,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:26,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:26,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328880471] [2025-03-08 06:29:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328880471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963477067] [2025-03-08 06:29:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:26,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:26,321 INFO L87 Difference]: Start difference. First operand 649 states and 815 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,032 INFO L93 Difference]: Finished difference Result 1004 states and 1271 transitions. [2025-03-08 06:29:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,033 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 06:29:27,033 INFO L226 Difference]: Without dead ends: 930 [2025-03-08 06:29:27,033 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-08 06:29:27,034 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2907 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 2324 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-08 06:29:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 649. [2025-03-08 06:29:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.2982456140350878) internal successors, (814), 648 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 814 transitions. [2025-03-08 06:29:27,039 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 814 transitions. Word has length 97 [2025-03-08 06:29:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,039 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 814 transitions. [2025-03-08 06:29:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 814 transitions. [2025-03-08 06:29:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:27,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,040 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] [2025-03-08 06:29:27,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 06:29:27,040 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 595347058, now seen corresponding path program 1 times [2025-03-08 06:29:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104676174] [2025-03-08 06:29:27,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:27,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:27,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104676174] [2025-03-08 06:29:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104676174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:27,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:27,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815836894] [2025-03-08 06:29:27,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:27,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:27,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:27,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:27,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:27,189 INFO L87 Difference]: Start difference. First operand 649 states and 814 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,848 INFO L93 Difference]: Finished difference Result 1060 states and 1347 transitions. [2025-03-08 06:29:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,849 INFO L225 Difference]: With dead ends: 1060 [2025-03-08 06:29:27,849 INFO L226 Difference]: Without dead ends: 974 [2025-03-08 06:29:27,849 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-08 06:29:27,850 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1819 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2676 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-08 06:29:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 645. [2025-03-08 06:29:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.2985553772070626) internal successors, (809), 644 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 809 transitions. [2025-03-08 06:29:27,854 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 809 transitions. Word has length 97 [2025-03-08 06:29:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,854 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 809 transitions. [2025-03-08 06:29:27,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 809 transitions. [2025-03-08 06:29:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:27,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,856 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] [2025-03-08 06:29:27,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 06:29:27,856 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:27,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415568, now seen corresponding path program 1 times [2025-03-08 06:29:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029863433] [2025-03-08 06:29:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:27,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:27,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029863433] [2025-03-08 06:29:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029863433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:28,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840740147] [2025-03-08 06:29:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:28,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:28,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:28,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:28,031 INFO L87 Difference]: Start difference. First operand 645 states and 809 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:28,730 INFO L93 Difference]: Finished difference Result 931 states and 1159 transitions. [2025-03-08 06:29:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:28,731 INFO L225 Difference]: With dead ends: 931 [2025-03-08 06:29:28,731 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 06:29:28,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:28,732 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 3791 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:28,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 2361 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 06:29:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 641. [2025-03-08 06:29:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.2988691437802908) internal successors, (804), 640 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 804 transitions. [2025-03-08 06:29:28,736 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 804 transitions. Word has length 97 [2025-03-08 06:29:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 804 transitions. [2025-03-08 06:29:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 804 transitions. [2025-03-08 06:29:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:28,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:28,736 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] [2025-03-08 06:29:28,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-08 06:29:28,737 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:28,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1769840326, now seen corresponding path program 1 times [2025-03-08 06:29:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:28,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905274852] [2025-03-08 06:29:28,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:28,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905274852] [2025-03-08 06:29:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905274852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:28,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:28,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88404693] [2025-03-08 06:29:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:28,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:28,927 INFO L87 Difference]: Start difference. First operand 641 states and 804 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:29,631 INFO L93 Difference]: Finished difference Result 1000 states and 1264 transitions. [2025-03-08 06:29:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:29,632 INFO L225 Difference]: With dead ends: 1000 [2025-03-08 06:29:29,632 INFO L226 Difference]: Without dead ends: 925 [2025-03-08 06:29:29,632 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-08 06:29:29,632 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 3460 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:29,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3460 Valid, 2622 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-08 06:29:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 640. [2025-03-08 06:29:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 618 states have (on average 1.2977346278317152) internal successors, (802), 639 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 802 transitions. [2025-03-08 06:29:29,639 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 802 transitions. Word has length 97 [2025-03-08 06:29:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:29,639 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 802 transitions. [2025-03-08 06:29:29,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 802 transitions. [2025-03-08 06:29:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:29,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:29,640 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] [2025-03-08 06:29:29,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-08 06:29:29,640 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:29,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2111857312, now seen corresponding path program 1 times [2025-03-08 06:29:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:29,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372519760] [2025-03-08 06:29:29,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:29,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372519760] [2025-03-08 06:29:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372519760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600796782] [2025-03-08 06:29:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:29,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:29,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:29,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:29,871 INFO L87 Difference]: Start difference. First operand 640 states and 802 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:30,873 INFO L93 Difference]: Finished difference Result 1181 states and 1528 transitions. [2025-03-08 06:29:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:30,874 INFO L225 Difference]: With dead ends: 1181 [2025-03-08 06:29:30,874 INFO L226 Difference]: Without dead ends: 1106 [2025-03-08 06:29:30,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:30,875 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 6837 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6837 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:30,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6837 Valid, 2983 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-08 06:29:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 644. [2025-03-08 06:29:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.2958199356913183) internal successors, (806), 643 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 806 transitions. [2025-03-08 06:29:30,882 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 806 transitions. Word has length 97 [2025-03-08 06:29:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 806 transitions. [2025-03-08 06:29:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 806 transitions. [2025-03-08 06:29:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:30,883 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] [2025-03-08 06:29:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-08 06:29:30,884 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1135289249, now seen corresponding path program 1 times [2025-03-08 06:29:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459875544] [2025-03-08 06:29:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:30,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:30,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:30,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459875544] [2025-03-08 06:29:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459875544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:31,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:31,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806145819] [2025-03-08 06:29:31,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:31,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:31,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:31,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:31,043 INFO L87 Difference]: Start difference. First operand 644 states and 806 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:31,701 INFO L93 Difference]: Finished difference Result 999 states and 1261 transitions. [2025-03-08 06:29:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:31,703 INFO L225 Difference]: With dead ends: 999 [2025-03-08 06:29:31,703 INFO L226 Difference]: Without dead ends: 924 [2025-03-08 06:29:31,703 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-08 06:29:31,703 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3785 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3785 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:31,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3785 Valid, 2372 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-08 06:29:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 644. [2025-03-08 06:29:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.2942122186495177) internal successors, (805), 643 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 805 transitions. [2025-03-08 06:29:31,707 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 805 transitions. Word has length 97 [2025-03-08 06:29:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:31,707 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 805 transitions. [2025-03-08 06:29:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 805 transitions. [2025-03-08 06:29:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:31,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:31,708 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] [2025-03-08 06:29:31,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-08 06:29:31,708 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:31,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1567241491, now seen corresponding path program 1 times [2025-03-08 06:29:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958999978] [2025-03-08 06:29:31,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:31,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:31,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:31,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:31,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958999978] [2025-03-08 06:29:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958999978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753418365] [2025-03-08 06:29:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:31,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:31,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:31,849 INFO L87 Difference]: Start difference. First operand 644 states and 805 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:32,430 INFO L93 Difference]: Finished difference Result 998 states and 1259 transitions. [2025-03-08 06:29:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:32,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:32,431 INFO L225 Difference]: With dead ends: 998 [2025-03-08 06:29:32,431 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:29:32,431 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-08 06:29:32,431 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3718 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3718 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:32,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3718 Valid, 2372 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:29:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 643. [2025-03-08 06:29:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.2930756843800322) internal successors, (803), 642 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 803 transitions. [2025-03-08 06:29:32,436 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 803 transitions. Word has length 97 [2025-03-08 06:29:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 803 transitions. [2025-03-08 06:29:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 803 transitions. [2025-03-08 06:29:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:32,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:32,437 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] [2025-03-08 06:29:32,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-08 06:29:32,437 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:32,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash 689047034, now seen corresponding path program 1 times [2025-03-08 06:29:32,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23625957] [2025-03-08 06:29:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:32,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:32,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:32,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:32,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23625957] [2025-03-08 06:29:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23625957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592450400] [2025-03-08 06:29:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:32,606 INFO L87 Difference]: Start difference. First operand 643 states and 803 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:33,264 INFO L93 Difference]: Finished difference Result 999 states and 1259 transitions. [2025-03-08 06:29:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:33,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:29:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:33,266 INFO L225 Difference]: With dead ends: 999 [2025-03-08 06:29:33,266 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:29:33,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:33,266 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2672 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2672 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:33,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2672 Valid, 2551 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:29:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 639. [2025-03-08 06:29:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.293354943273906) internal successors, (798), 638 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2025-03-08 06:29:33,270 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 97 [2025-03-08 06:29:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2025-03-08 06:29:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2025-03-08 06:29:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:33,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:33,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:33,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-08 06:29:33,271 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1275087781, now seen corresponding path program 1 times [2025-03-08 06:29:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009016999] [2025-03-08 06:29:33,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:33,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:33,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat