./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 61079a62c86de0622c6f0d8d69ab5d3bd5c88209c75f4f3a60aa83a2a40500fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:45:26,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:45:26,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:45:26,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:45:26,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:45:26,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:45:26,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:45:26,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:45:26,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:45:26,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:45:26,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:45:26,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:45:26,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:45:26,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:45:26,474 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:45:26,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:45:26,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:45:26,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:45:26,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:45:26,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:45:26,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:45:26,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:45:26,478 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-jdk21/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 -> 61079a62c86de0622c6f0d8d69ab5d3bd5c88209c75f4f3a60aa83a2a40500fd [2025-01-09 04:45:26,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:45:26,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:45:26,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:45:26,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:45:26,760 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:45:26,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:45:27,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f17924af/5a0789d1a1c84abe802babe884a044b6/FLAG9440ed043 [2025-01-09 04:45:28,417 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:45:28,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:45:28,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f17924af/5a0789d1a1c84abe802babe884a044b6/FLAG9440ed043 [2025-01-09 04:45:28,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f17924af/5a0789d1a1c84abe802babe884a044b6 [2025-01-09 04:45:28,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:45:28,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:45:28,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:45:28,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:45:28,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:45:28,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:28" (1/1) ... [2025-01-09 04:45:28,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee16ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:28, skipping insertion in model container [2025-01-09 04:45:28,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:28" (1/1) ... [2025-01-09 04:45:28,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:45:29,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82693,82706] [2025-01-09 04:45:29,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[113477,113490] [2025-01-09 04:45:29,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[165794,165807] [2025-01-09 04:45:29,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[197365,197378] [2025-01-09 04:45:29,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[205886,205899] [2025-01-09 04:45:29,576 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[207836,207849] [2025-01-09 04:45:29,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[224171,224184] [2025-01-09 04:45:29,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231245,231258] [2025-01-09 04:45:29,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[259571,259584] [2025-01-09 04:45:29,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[287337,287350] [2025-01-09 04:45:29,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[370939,370952] [2025-01-09 04:45:29,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[389606,389619] [2025-01-09 04:45:29,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[408649,408662] [2025-01-09 04:45:29,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[415665,415678] [2025-01-09 04:45:29,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[419162,419175] [2025-01-09 04:45:29,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[433807,433820] [2025-01-09 04:45:29,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[448287,448300] [2025-01-09 04:45:29,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[480365,480378] [2025-01-09 04:45:30,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[569807,569820] [2025-01-09 04:45:30,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:45:30,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:45:30,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82693,82706] [2025-01-09 04:45:30,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[113477,113490] [2025-01-09 04:45:30,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[165794,165807] [2025-01-09 04:45:30,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[197365,197378] [2025-01-09 04:45:30,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[205886,205899] [2025-01-09 04:45:30,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[207836,207849] [2025-01-09 04:45:30,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[224171,224184] [2025-01-09 04:45:30,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231245,231258] [2025-01-09 04:45:30,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[259571,259584] [2025-01-09 04:45:30,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[287337,287350] [2025-01-09 04:45:30,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[370939,370952] [2025-01-09 04:45:30,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[389606,389619] [2025-01-09 04:45:30,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[408649,408662] [2025-01-09 04:45:30,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[415665,415678] [2025-01-09 04:45:30,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[419162,419175] [2025-01-09 04:45:30,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[433807,433820] [2025-01-09 04:45:30,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[448287,448300] [2025-01-09 04:45:30,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[480365,480378] [2025-01-09 04:45:30,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[569807,569820] [2025-01-09 04:45:31,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:45:31,073 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:45:31,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31 WrapperNode [2025-01-09 04:45:31,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:45:31,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:45:31,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:45:31,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:45:31,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,545 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30433 [2025-01-09 04:45:31,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:45:31,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:45:31,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:45:31,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:45:31,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,829 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-01-09 04:45:31,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:31,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:32,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:32,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:32,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:32,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:45:32,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:45:32,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:45:32,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:45:32,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (1/1) ... [2025-01-09 04:45:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:45:32,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:45:32,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:45:32,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:45:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:45:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:45:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:45:32,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:45:32,767 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:45:32,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:45:41,918 INFO L? ?]: Removed 5544 outVars from TransFormulas that were not future-live. [2025-01-09 04:45:41,918 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:45:42,011 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:45:42,011 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:45:42,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:42 BoogieIcfgContainer [2025-01-09 04:45:42,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:45:42,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:45:42,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:45:42,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:45:42,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:45:28" (1/3) ... [2025-01-09 04:45:42,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d08b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:42, skipping insertion in model container [2025-01-09 04:45:42,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:31" (2/3) ... [2025-01-09 04:45:42,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d08b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:42, skipping insertion in model container [2025-01-09 04:45:42,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:42" (3/3) ... [2025-01-09 04:45:42,021 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:45:42,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:45:42,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 6183 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-01-09 04:45:42,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:45:42,205 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;@4632d41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:45:42,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 04:45:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 6183 states, 6163 states have (on average 1.8075612526367029) internal successors, (11140), 6182 states have internal predecessors, (11140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:45:42,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:42,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] [2025-01-09 04:45:42,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:45:42,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 642976960, now seen corresponding path program 1 times [2025-01-09 04:45:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547245448] [2025-01-09 04:45:42,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:45:42,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:45:42,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:45:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:45:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:45:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547245448] [2025-01-09 04:45:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547245448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:45:42,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:45:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:45:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257902682] [2025-01-09 04:45:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:45:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:45:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:45:42,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:45:42,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:45:42,969 INFO L87 Difference]: Start difference. First operand has 6183 states, 6163 states have (on average 1.8075612526367029) internal successors, (11140), 6182 states have internal predecessors, (11140), 0 states have call successors, (0), 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 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:45:47,002 INFO L93 Difference]: Finished difference Result 9223 states and 16402 transitions. [2025-01-09 04:45:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:45:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:45:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:45:47,047 INFO L225 Difference]: With dead ends: 9223 [2025-01-09 04:45:47,047 INFO L226 Difference]: Without dead ends: 5815 [2025-01-09 04:45:47,060 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-01-09 04:45:47,063 INFO L435 NwaCegarLoop]: 4776 mSDtfsCounter, 29236 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 4688 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29236 SdHoareTripleChecker+Valid, 5738 SdHoareTripleChecker+Invalid, 4751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:45:47,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29236 Valid, 5738 Invalid, 4751 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 4688 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 04:45:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5815 states. [2025-01-09 04:45:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5815 to 5785. [2025-01-09 04:45:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5766 states have (on average 1.3331599028789456) internal successors, (7687), 5784 states have internal predecessors, (7687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 7687 transitions. [2025-01-09 04:45:47,259 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 7687 transitions. Word has length 77 [2025-01-09 04:45:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:45:47,259 INFO L471 AbstractCegarLoop]: Abstraction has 5785 states and 7687 transitions. [2025-01-09 04:45:47,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 7687 transitions. [2025-01-09 04:45:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:45:47,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:47,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] [2025-01-09 04:45:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:45:47,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:45:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1955930775, now seen corresponding path program 1 times [2025-01-09 04:45:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476400761] [2025-01-09 04:45:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:47,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:45:47,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:45:47,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:47,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:45:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:45:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:45:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476400761] [2025-01-09 04:45:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476400761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:45:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:45:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:45:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655909499] [2025-01-09 04:45:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:45:47,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:45:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:45:47,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:45:47,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:45:47,713 INFO L87 Difference]: Start difference. First operand 5785 states and 7687 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:45:53,033 INFO L93 Difference]: Finished difference Result 6282 states and 8361 transitions. [2025-01-09 04:45:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:45:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:45:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:45:53,053 INFO L225 Difference]: With dead ends: 6282 [2025-01-09 04:45:53,053 INFO L226 Difference]: Without dead ends: 6277 [2025-01-09 04:45:53,056 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-01-09 04:45:53,057 INFO L435 NwaCegarLoop]: 3022 mSDtfsCounter, 15643 mSDsluCounter, 9123 mSDsCounter, 0 mSdLazyCounter, 13888 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15643 SdHoareTripleChecker+Valid, 12145 SdHoareTripleChecker+Invalid, 13949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 13888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:45:53,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15643 Valid, 12145 Invalid, 13949 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 13888 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 04:45:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2025-01-09 04:45:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 5785. [2025-01-09 04:45:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5766 states have (on average 1.3329864724245577) internal successors, (7686), 5784 states have internal predecessors, (7686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 7686 transitions. [2025-01-09 04:45:53,164 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 7686 transitions. Word has length 78 [2025-01-09 04:45:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:45:53,165 INFO L471 AbstractCegarLoop]: Abstraction has 5785 states and 7686 transitions. [2025-01-09 04:45:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 7686 transitions. [2025-01-09 04:45:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:45:53,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:53,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:45:53,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:45:53,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:45:53,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2136533534, now seen corresponding path program 1 times [2025-01-09 04:45:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:53,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148940205] [2025-01-09 04:45:53,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:53,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:45:53,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:45:53,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:53,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:45:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:45:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:45:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148940205] [2025-01-09 04:45:53,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148940205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:45:53,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:45:53,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:45:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310239106] [2025-01-09 04:45:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:45:53,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:45:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:45:53,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:45:53,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:45:53,366 INFO L87 Difference]: Start difference. First operand 5785 states and 7686 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:45:56,362 INFO L93 Difference]: Finished difference Result 11480 states and 15434 transitions. [2025-01-09 04:45:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:45:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:45:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:45:56,383 INFO L225 Difference]: With dead ends: 11480 [2025-01-09 04:45:56,383 INFO L226 Difference]: Without dead ends: 7760 [2025-01-09 04:45:56,390 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-01-09 04:45:56,391 INFO L435 NwaCegarLoop]: 2954 mSDtfsCounter, 23497 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 4727 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23497 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 4814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:45:56,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23497 Valid, 3936 Invalid, 4814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4727 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 04:45:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2025-01-09 04:45:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 7736. [2025-01-09 04:45:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7736 states, 7717 states have (on average 1.3389918362057796) internal successors, (10333), 7735 states have internal predecessors, (10333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 10333 transitions. [2025-01-09 04:45:56,504 INFO L78 Accepts]: Start accepts. Automaton has 7736 states and 10333 transitions. Word has length 78 [2025-01-09 04:45:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:45:56,504 INFO L471 AbstractCegarLoop]: Abstraction has 7736 states and 10333 transitions. [2025-01-09 04:45:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7736 states and 10333 transitions. [2025-01-09 04:45:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:45:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:56,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:45:56,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:45:56,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:45:56,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 816480341, now seen corresponding path program 1 times [2025-01-09 04:45:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866063112] [2025-01-09 04:45:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:45:56,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:45:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:56,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:45:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:45:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:45:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866063112] [2025-01-09 04:45:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866063112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:45:56,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:45:56,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:45:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489973112] [2025-01-09 04:45:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:45:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:45:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:45:56,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:45:56,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:45:56,669 INFO L87 Difference]: Start difference. First operand 7736 states and 10333 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:45:59,204 INFO L93 Difference]: Finished difference Result 15140 states and 20342 transitions. [2025-01-09 04:45:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:45:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:45:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:45:59,227 INFO L225 Difference]: With dead ends: 15140 [2025-01-09 04:45:59,228 INFO L226 Difference]: Without dead ends: 9760 [2025-01-09 04:45:59,235 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-01-09 04:45:59,236 INFO L435 NwaCegarLoop]: 2860 mSDtfsCounter, 21329 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21329 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:45:59,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21329 Valid, 3626 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:45:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2025-01-09 04:45:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 9734. [2025-01-09 04:45:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9734 states, 9715 states have (on average 1.3288728769943388) internal successors, (12910), 9733 states have internal predecessors, (12910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 12910 transitions. [2025-01-09 04:45:59,362 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 12910 transitions. Word has length 79 [2025-01-09 04:45:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:45:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 9734 states and 12910 transitions. [2025-01-09 04:45:59,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:45:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 12910 transitions. [2025-01-09 04:45:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:45:59,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:59,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:45:59,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:45:59,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:45:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash 42417281, now seen corresponding path program 1 times [2025-01-09 04:45:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126644789] [2025-01-09 04:45:59,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:59,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:45:59,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:45:59,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:59,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:00,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:00,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126644789] [2025-01-09 04:46:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126644789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:46:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272976627] [2025-01-09 04:46:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:46:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:00,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:46:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:46:00,459 INFO L87 Difference]: Start difference. First operand 9734 states and 12910 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:03,261 INFO L93 Difference]: Finished difference Result 16581 states and 22679 transitions. [2025-01-09 04:46:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:46:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:46:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:03,288 INFO L225 Difference]: With dead ends: 16581 [2025-01-09 04:46:03,289 INFO L226 Difference]: Without dead ends: 16573 [2025-01-09 04:46:03,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:46:03,295 INFO L435 NwaCegarLoop]: 5906 mSDtfsCounter, 44712 mSDsluCounter, 33458 mSDsCounter, 0 mSdLazyCounter, 4765 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44712 SdHoareTripleChecker+Valid, 39364 SdHoareTripleChecker+Invalid, 4821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:03,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44712 Valid, 39364 Invalid, 4821 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 4765 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:46:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16573 states. [2025-01-09 04:46:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16573 to 9726. [2025-01-09 04:46:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 9708 states have (on average 1.3290070045323445) internal successors, (12902), 9725 states have internal predecessors, (12902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 12902 transitions. [2025-01-09 04:46:03,456 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 12902 transitions. Word has length 79 [2025-01-09 04:46:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:03,458 INFO L471 AbstractCegarLoop]: Abstraction has 9726 states and 12902 transitions. [2025-01-09 04:46:03,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 12902 transitions. [2025-01-09 04:46:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:46:03,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:03,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:03,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:46:03,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1994039540, now seen corresponding path program 1 times [2025-01-09 04:46:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233315447] [2025-01-09 04:46:03,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:03,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:46:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:46:03,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:03,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:03,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233315447] [2025-01-09 04:46:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233315447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080840710] [2025-01-09 04:46:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:03,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:03,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:03,594 INFO L87 Difference]: Start difference. First operand 9726 states and 12902 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:05,782 INFO L93 Difference]: Finished difference Result 17851 states and 23937 transitions. [2025-01-09 04:46:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:46:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:05,799 INFO L225 Difference]: With dead ends: 17851 [2025-01-09 04:46:05,799 INFO L226 Difference]: Without dead ends: 11721 [2025-01-09 04:46:05,805 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-01-09 04:46:05,807 INFO L435 NwaCegarLoop]: 2427 mSDtfsCounter, 17777 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17777 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:05,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17777 Valid, 3189 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:46:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11721 states. [2025-01-09 04:46:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11721 to 11692. [2025-01-09 04:46:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11692 states, 11674 states have (on average 1.3539489463765633) internal successors, (15806), 11691 states have internal predecessors, (15806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 15806 transitions. [2025-01-09 04:46:05,934 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 15806 transitions. Word has length 79 [2025-01-09 04:46:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:05,934 INFO L471 AbstractCegarLoop]: Abstraction has 11692 states and 15806 transitions. [2025-01-09 04:46:05,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 15806 transitions. [2025-01-09 04:46:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:46:05,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:05,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:05,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:46:05,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1428801169, now seen corresponding path program 1 times [2025-01-09 04:46:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360196778] [2025-01-09 04:46:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:05,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:46:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:46:06,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:06,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360196778] [2025-01-09 04:46:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360196778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:46:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704605021] [2025-01-09 04:46:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:46:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:06,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:46:06,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:46:06,329 INFO L87 Difference]: Start difference. First operand 11692 states and 15806 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:11,765 INFO L93 Difference]: Finished difference Result 16055 states and 22029 transitions. [2025-01-09 04:46:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:46:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:46:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:11,786 INFO L225 Difference]: With dead ends: 16055 [2025-01-09 04:46:11,786 INFO L226 Difference]: Without dead ends: 14332 [2025-01-09 04:46:11,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:46:11,794 INFO L435 NwaCegarLoop]: 2356 mSDtfsCounter, 20934 mSDsluCounter, 11656 mSDsCounter, 0 mSdLazyCounter, 15566 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20934 SdHoareTripleChecker+Valid, 14012 SdHoareTripleChecker+Invalid, 15576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 15566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:11,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20934 Valid, 14012 Invalid, 15576 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 15566 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 04:46:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2025-01-09 04:46:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 11699. [2025-01-09 04:46:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11699 states, 11681 states have (on average 1.3537368375995207) internal successors, (15813), 11698 states have internal predecessors, (15813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11699 states to 11699 states and 15813 transitions. [2025-01-09 04:46:11,974 INFO L78 Accepts]: Start accepts. Automaton has 11699 states and 15813 transitions. Word has length 80 [2025-01-09 04:46:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:11,975 INFO L471 AbstractCegarLoop]: Abstraction has 11699 states and 15813 transitions. [2025-01-09 04:46:11,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11699 states and 15813 transitions. [2025-01-09 04:46:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:46:11,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:11,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] [2025-01-09 04:46:11,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:46:11,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:11,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1294381398, now seen corresponding path program 1 times [2025-01-09 04:46:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512956350] [2025-01-09 04:46:11,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:12,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:46:12,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:46:12,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:12,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512956350] [2025-01-09 04:46:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512956350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:12,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:12,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661159840] [2025-01-09 04:46:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:12,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:12,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:12,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:12,142 INFO L87 Difference]: Start difference. First operand 11699 states and 15813 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:14,098 INFO L93 Difference]: Finished difference Result 23220 states and 31550 transitions. [2025-01-09 04:46:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:46:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:14,121 INFO L225 Difference]: With dead ends: 23220 [2025-01-09 04:46:14,121 INFO L226 Difference]: Without dead ends: 15844 [2025-01-09 04:46:14,131 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-01-09 04:46:14,132 INFO L435 NwaCegarLoop]: 2093 mSDtfsCounter, 15570 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15570 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:14,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15570 Valid, 2815 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2945 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:46:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15844 states. [2025-01-09 04:46:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15844 to 15824. [2025-01-09 04:46:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15824 states, 15806 states have (on average 1.3551815766164748) internal successors, (21420), 15823 states have internal predecessors, (21420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15824 states to 15824 states and 21420 transitions. [2025-01-09 04:46:14,318 INFO L78 Accepts]: Start accepts. Automaton has 15824 states and 21420 transitions. Word has length 80 [2025-01-09 04:46:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 15824 states and 21420 transitions. [2025-01-09 04:46:14,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15824 states and 21420 transitions. [2025-01-09 04:46:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:46:14,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:14,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:14,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:46:14,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1633622625, now seen corresponding path program 1 times [2025-01-09 04:46:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373779265] [2025-01-09 04:46:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:46:14,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:46:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373779265] [2025-01-09 04:46:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373779265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:14,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:14,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713127022] [2025-01-09 04:46:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:14,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:14,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:14,405 INFO L87 Difference]: Start difference. First operand 15824 states and 21420 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:14,820 INFO L93 Difference]: Finished difference Result 31749 states and 43433 transitions. [2025-01-09 04:46:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:46:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:14,844 INFO L225 Difference]: With dead ends: 31749 [2025-01-09 04:46:14,845 INFO L226 Difference]: Without dead ends: 19509 [2025-01-09 04:46:14,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:14,859 INFO L435 NwaCegarLoop]: 3952 mSDtfsCounter, 3993 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3993 SdHoareTripleChecker+Valid, 5148 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:14,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3993 Valid, 5148 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:46:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19509 states. [2025-01-09 04:46:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19509 to 19482. [2025-01-09 04:46:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19482 states, 19464 states have (on average 1.3550143855322647) internal successors, (26374), 19481 states have internal predecessors, (26374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19482 states to 19482 states and 26374 transitions. [2025-01-09 04:46:15,189 INFO L78 Accepts]: Start accepts. Automaton has 19482 states and 26374 transitions. Word has length 81 [2025-01-09 04:46:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:15,189 INFO L471 AbstractCegarLoop]: Abstraction has 19482 states and 26374 transitions. [2025-01-09 04:46:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19482 states and 26374 transitions. [2025-01-09 04:46:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:46:15,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:15,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:15,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:46:15,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1819290860, now seen corresponding path program 1 times [2025-01-09 04:46:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472645146] [2025-01-09 04:46:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:46:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:46:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472645146] [2025-01-09 04:46:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472645146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:16,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:46:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262021881] [2025-01-09 04:46:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:46:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:16,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:46:16,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:46:16,011 INFO L87 Difference]: Start difference. First operand 19482 states and 26374 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:18,432 INFO L93 Difference]: Finished difference Result 28694 states and 40087 transitions. [2025-01-09 04:46:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:46:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:46:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:18,468 INFO L225 Difference]: With dead ends: 28694 [2025-01-09 04:46:18,469 INFO L226 Difference]: Without dead ends: 28690 [2025-01-09 04:46:18,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:46:18,480 INFO L435 NwaCegarLoop]: 3766 mSDtfsCounter, 21376 mSDsluCounter, 23396 mSDsCounter, 0 mSdLazyCounter, 4342 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21376 SdHoareTripleChecker+Valid, 27162 SdHoareTripleChecker+Invalid, 4387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:18,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21376 Valid, 27162 Invalid, 4387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4342 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:46:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28690 states. [2025-01-09 04:46:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28690 to 19478. [2025-01-09 04:46:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19478 states, 19461 states have (on average 1.3550177277632187) internal successors, (26370), 19477 states have internal predecessors, (26370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19478 states to 19478 states and 26370 transitions. [2025-01-09 04:46:18,747 INFO L78 Accepts]: Start accepts. Automaton has 19478 states and 26370 transitions. Word has length 81 [2025-01-09 04:46:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:18,748 INFO L471 AbstractCegarLoop]: Abstraction has 19478 states and 26370 transitions. [2025-01-09 04:46:18,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 19478 states and 26370 transitions. [2025-01-09 04:46:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:46:18,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:18,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:46:18,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 153905521, now seen corresponding path program 1 times [2025-01-09 04:46:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269388270] [2025-01-09 04:46:18,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:46:18,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:46:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269388270] [2025-01-09 04:46:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269388270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:19,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:19,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:19,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445681852] [2025-01-09 04:46:19,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:19,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:46:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:19,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:46:19,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:46:19,047 INFO L87 Difference]: Start difference. First operand 19478 states and 26370 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:22,264 INFO L93 Difference]: Finished difference Result 24781 states and 33760 transitions. [2025-01-09 04:46:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:46:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:46:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:22,302 INFO L225 Difference]: With dead ends: 24781 [2025-01-09 04:46:22,303 INFO L226 Difference]: Without dead ends: 24773 [2025-01-09 04:46:22,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:46:22,313 INFO L435 NwaCegarLoop]: 2082 mSDtfsCounter, 21592 mSDsluCounter, 6630 mSDsCounter, 0 mSdLazyCounter, 8737 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21592 SdHoareTripleChecker+Valid, 8712 SdHoareTripleChecker+Invalid, 8779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:22,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21592 Valid, 8712 Invalid, 8779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 8737 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 04:46:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24773 states. [2025-01-09 04:46:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24773 to 19478. [2025-01-09 04:46:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19478 states, 19461 states have (on average 1.354966342942295) internal successors, (26369), 19477 states have internal predecessors, (26369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19478 states to 19478 states and 26369 transitions. [2025-01-09 04:46:22,560 INFO L78 Accepts]: Start accepts. Automaton has 19478 states and 26369 transitions. Word has length 81 [2025-01-09 04:46:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:22,560 INFO L471 AbstractCegarLoop]: Abstraction has 19478 states and 26369 transitions. [2025-01-09 04:46:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19478 states and 26369 transitions. [2025-01-09 04:46:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:46:22,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:22,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:22,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:46:22,570 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:22,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1262373862, now seen corresponding path program 1 times [2025-01-09 04:46:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246156512] [2025-01-09 04:46:22,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:22,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:46:22,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:46:22,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:22,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:23,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-01-09 04:46:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246156512] [2025-01-09 04:46:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246156512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:46:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014951139] [2025-01-09 04:46:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:23,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:46:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:23,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:46:23,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:46:23,109 INFO L87 Difference]: Start difference. First operand 19478 states and 26369 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:27,497 INFO L93 Difference]: Finished difference Result 25593 states and 35734 transitions. [2025-01-09 04:46:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:46:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:46:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:27,518 INFO L225 Difference]: With dead ends: 25593 [2025-01-09 04:46:27,519 INFO L226 Difference]: Without dead ends: 20838 [2025-01-09 04:46:27,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:46:27,527 INFO L435 NwaCegarLoop]: 2023 mSDtfsCounter, 17407 mSDsluCounter, 10368 mSDsCounter, 0 mSdLazyCounter, 12814 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17407 SdHoareTripleChecker+Valid, 12391 SdHoareTripleChecker+Invalid, 12822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:27,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17407 Valid, 12391 Invalid, 12822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12814 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 04:46:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20838 states. [2025-01-09 04:46:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20838 to 19227. [2025-01-09 04:46:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19227 states, 19210 states have (on average 1.3563248308172826) internal successors, (26055), 19226 states have internal predecessors, (26055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 26055 transitions. [2025-01-09 04:46:27,751 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 26055 transitions. Word has length 82 [2025-01-09 04:46:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:27,751 INFO L471 AbstractCegarLoop]: Abstraction has 19227 states and 26055 transitions. [2025-01-09 04:46:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 26055 transitions. [2025-01-09 04:46:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:46:27,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:27,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:46:27,760 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -521520380, now seen corresponding path program 1 times [2025-01-09 04:46:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775731998] [2025-01-09 04:46:27,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:27,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:46:27,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:46:27,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775731998] [2025-01-09 04:46:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775731998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:28,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:28,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:46:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143358448] [2025-01-09 04:46:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:28,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:46:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:28,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:46:28,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:46:28,179 INFO L87 Difference]: Start difference. First operand 19227 states and 26055 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:29,907 INFO L93 Difference]: Finished difference Result 29077 states and 40482 transitions. [2025-01-09 04:46:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:46:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:46:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:29,935 INFO L225 Difference]: With dead ends: 29077 [2025-01-09 04:46:29,935 INFO L226 Difference]: Without dead ends: 24466 [2025-01-09 04:46:29,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:46:29,950 INFO L435 NwaCegarLoop]: 3808 mSDtfsCounter, 19129 mSDsluCounter, 20416 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19129 SdHoareTripleChecker+Valid, 24224 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:29,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19129 Valid, 24224 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:46:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24466 states. [2025-01-09 04:46:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24466 to 19195. [2025-01-09 04:46:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19195 states, 19178 states have (on average 1.3565543852330795) internal successors, (26016), 19194 states have internal predecessors, (26016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19195 states to 19195 states and 26016 transitions. [2025-01-09 04:46:30,170 INFO L78 Accepts]: Start accepts. Automaton has 19195 states and 26016 transitions. Word has length 82 [2025-01-09 04:46:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:30,170 INFO L471 AbstractCegarLoop]: Abstraction has 19195 states and 26016 transitions. [2025-01-09 04:46:30,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19195 states and 26016 transitions. [2025-01-09 04:46:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:46:30,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:30,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:30,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:46:30,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:30,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1082319899, now seen corresponding path program 1 times [2025-01-09 04:46:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740801568] [2025-01-09 04:46:30,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:30,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:46:30,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:46:30,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:30,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:30,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-01-09 04:46:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:30,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740801568] [2025-01-09 04:46:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740801568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:46:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118988396] [2025-01-09 04:46:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:30,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:46:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:46:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:46:30,587 INFO L87 Difference]: Start difference. First operand 19195 states and 26016 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:35,068 INFO L93 Difference]: Finished difference Result 29492 states and 40858 transitions. [2025-01-09 04:46:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:46:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:46:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:35,095 INFO L225 Difference]: With dead ends: 29492 [2025-01-09 04:46:35,095 INFO L226 Difference]: Without dead ends: 24921 [2025-01-09 04:46:35,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:46:35,104 INFO L435 NwaCegarLoop]: 2073 mSDtfsCounter, 17530 mSDsluCounter, 10602 mSDsCounter, 0 mSdLazyCounter, 12980 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17530 SdHoareTripleChecker+Valid, 12675 SdHoareTripleChecker+Invalid, 13040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 12980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:35,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17530 Valid, 12675 Invalid, 13040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 12980 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 04:46:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24921 states. [2025-01-09 04:46:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24921 to 19126. [2025-01-09 04:46:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19126 states, 19109 states have (on average 1.3563242451201005) internal successors, (25918), 19125 states have internal predecessors, (25918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 25918 transitions. [2025-01-09 04:46:35,344 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 25918 transitions. Word has length 82 [2025-01-09 04:46:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 19126 states and 25918 transitions. [2025-01-09 04:46:35,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 25918 transitions. [2025-01-09 04:46:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:46:35,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:35,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:46:35,354 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:35,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash 47212227, now seen corresponding path program 1 times [2025-01-09 04:46:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:35,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782140477] [2025-01-09 04:46:35,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:35,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:46:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:46:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782140477] [2025-01-09 04:46:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782140477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:35,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600205228] [2025-01-09 04:46:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:46:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:35,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:46:35,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:46:35,562 INFO L87 Difference]: Start difference. First operand 19126 states and 25918 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:38,514 INFO L93 Difference]: Finished difference Result 27801 states and 38824 transitions. [2025-01-09 04:46:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:46:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 04:46:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:38,539 INFO L225 Difference]: With dead ends: 27801 [2025-01-09 04:46:38,539 INFO L226 Difference]: Without dead ends: 23298 [2025-01-09 04:46:38,549 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-01-09 04:46:38,550 INFO L435 NwaCegarLoop]: 2089 mSDtfsCounter, 16613 mSDsluCounter, 6610 mSDsCounter, 0 mSdLazyCounter, 8537 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16613 SdHoareTripleChecker+Valid, 8699 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 8537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:38,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16613 Valid, 8699 Invalid, 8569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 8537 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:46:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23298 states. [2025-01-09 04:46:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23298 to 19126. [2025-01-09 04:46:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19126 states, 19109 states have (on average 1.3562719137579151) internal successors, (25917), 19125 states have internal predecessors, (25917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 25917 transitions. [2025-01-09 04:46:38,774 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 25917 transitions. Word has length 83 [2025-01-09 04:46:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:38,774 INFO L471 AbstractCegarLoop]: Abstraction has 19126 states and 25917 transitions. [2025-01-09 04:46:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 25917 transitions. [2025-01-09 04:46:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:46:38,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:38,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:38,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:46:38,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:38,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1453267902, now seen corresponding path program 1 times [2025-01-09 04:46:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:38,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001861539] [2025-01-09 04:46:38,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:38,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:46:38,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:46:38,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001861539] [2025-01-09 04:46:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001861539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376885821] [2025-01-09 04:46:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:39,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:46:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:39,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:46:39,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:46:39,237 INFO L87 Difference]: Start difference. First operand 19126 states and 25917 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:42,305 INFO L93 Difference]: Finished difference Result 28845 states and 40181 transitions. [2025-01-09 04:46:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:46:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 04:46:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:42,329 INFO L225 Difference]: With dead ends: 28845 [2025-01-09 04:46:42,329 INFO L226 Difference]: Without dead ends: 24323 [2025-01-09 04:46:42,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:46:42,338 INFO L435 NwaCegarLoop]: 2073 mSDtfsCounter, 15916 mSDsluCounter, 6604 mSDsCounter, 0 mSdLazyCounter, 8653 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15916 SdHoareTripleChecker+Valid, 8677 SdHoareTripleChecker+Invalid, 8695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:42,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15916 Valid, 8677 Invalid, 8695 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 8653 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:46:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24323 states. [2025-01-09 04:46:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24323 to 19126. [2025-01-09 04:46:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19126 states, 19109 states have (on average 1.3562195823957297) internal successors, (25916), 19125 states have internal predecessors, (25916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 25916 transitions. [2025-01-09 04:46:42,552 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 25916 transitions. Word has length 83 [2025-01-09 04:46:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:42,552 INFO L471 AbstractCegarLoop]: Abstraction has 19126 states and 25916 transitions. [2025-01-09 04:46:42,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 25916 transitions. [2025-01-09 04:46:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:46:42,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:42,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:46:42,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2025-01-09 04:46:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1144387461, now seen corresponding path program 1 times [2025-01-09 04:46:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892693315] [2025-01-09 04:46:42,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:46:42,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:46:42,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:42,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892693315] [2025-01-09 04:46:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892693315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:42,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75360990] [2025-01-09 04:46:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:46:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:42,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:46:42,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:46:42,800 INFO L87 Difference]: Start difference. First operand 19126 states and 25916 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)