./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:29:02,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:29:02,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:29:02,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:29:02,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:29:02,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:29:02,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:29:02,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:29:02,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:29:02,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:29:02,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:29:02,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:29:02,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:29:02,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:29:02,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:29:02,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:29:02,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:29:02,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:02,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:29:02,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a [2025-03-08 06:29:02,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:29:02,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:29:02,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:29:02,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:29:02,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:29:02,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:29:03,761 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085140883/df62837bd3c94f21827819be5e9a8f37/FLAG27d5fe185 [2025-03-08 06:29:04,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:29:04,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:29:04,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085140883/df62837bd3c94f21827819be5e9a8f37/FLAG27d5fe185 [2025-03-08 06:29:04,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085140883/df62837bd3c94f21827819be5e9a8f37 [2025-03-08 06:29:04,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:29:04,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:29:04,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:04,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:29:04,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:29:04,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:04" (1/1) ... [2025-03-08 06:29:04,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ce4e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:04, skipping insertion in model container [2025-03-08 06:29:04,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:04" (1/1) ... [2025-03-08 06:29:04,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:29:05,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-08 06:29:05,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-08 06:29:05,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-08 06:29:05,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-08 06:29:05,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-08 06:29:05,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-08 06:29:05,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-08 06:29:05,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-08 06:29:05,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-08 06:29:05,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-08 06:29:05,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-08 06:29:05,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-08 06:29:05,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-08 06:29:05,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-08 06:29:05,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-08 06:29:05,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-08 06:29:05,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-08 06:29:05,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-08 06:29:05,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-08 06:29:05,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-08 06:29:05,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-08 06:29:05,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-08 06:29:05,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-08 06:29:05,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-08 06:29:05,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-08 06:29:05,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-08 06:29:05,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-08 06:29:05,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-08 06:29:06,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-08 06:29:06,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:06,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:29:06,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-08 06:29:06,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-08 06:29:06,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-08 06:29:06,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-08 06:29:06,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-08 06:29:06,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-08 06:29:06,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-08 06:29:06,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-08 06:29:06,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-08 06:29:06,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-08 06:29:06,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-08 06:29:06,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-08 06:29:06,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-08 06:29:06,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-08 06:29:06,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-08 06:29:06,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-08 06:29:06,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-08 06:29:06,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-08 06:29:06,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-08 06:29:06,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-08 06:29:06,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-08 06:29:06,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-08 06:29:06,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-08 06:29:06,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-08 06:29:06,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-08 06:29:06,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-08 06:29:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-08 06:29:06,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-08 06:29:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-08 06:29:07,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:07,073 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:29:07,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07 WrapperNode [2025-03-08 06:29:07,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:07,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:07,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:29:07,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:29:07,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,477 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25985 [2025-03-08 06:29:07,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:07,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:29:07,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:29:07,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:29:07,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,635 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:29:07,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:29:07,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:29:07,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:29:07,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:29:07,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (1/1) ... [2025-03-08 06:29:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:29:07,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:29:08,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:29:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:29:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:29:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:29:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:29:08,385 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:29:08,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:29:16,356 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L39085: havoc main_~check__tmp~162#1;havoc main_~node7__m7~168#1;havoc main_~node6__m6~141#1;havoc main_~node5__m5~127#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~116#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~113#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~161#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44370: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34858: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~149#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8961: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~30#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17419: havoc main_~node7__m7~72#1;havoc main_~node6__m6~61#1;havoc main_~node5__m5~55#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22708: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~95#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8441: havoc main_~node7__m7~33#1;havoc main_~node6__m6~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L37511: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~135#1; [2025-03-08 06:29:16,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42799: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1;havoc main_~node7__m7~184#1;havoc main_~node6__m6~154#1;havoc main_~node5__m5~139#1;havoc main_~node4__m4~131#1;havoc main_~node3__m3~127#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~124#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26946: havoc main_~node7__m7~114#1;havoc main_~node6__m6~96#1;havoc main_~node5__m5~86#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~100#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~node7__m7~1#1;havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8978: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~35#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38046: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~156#1;havoc main_~node7__m7~163#1;havoc main_~node6__m6~137#1;havoc main_~node5__m5~123#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~110#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~155#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30648: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~118#1;havoc main_~node7__m7~130#1;havoc main_~node6__m6~109#1;havoc main_~node5__m5~98#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~88#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~117#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15855: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~55#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7400: havoc main_~node7__m7~28#1;havoc main_~node6__m6~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42283: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~182#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44398: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:29:16,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34356: havoc main_~node7__m7~147#1;havoc main_~node6__m6~123#1;havoc main_~node5__m5~111#1;havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~99#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~136#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L37528: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~161#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30130: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~128#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16390: havoc main_~check__tmp~54#1;havoc main_~node7__m7~67#1;havoc main_~node6__m6~57#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5298: havoc main_~node7__m7~19#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~15#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21154: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~77#1;havoc main_~node7__m7~88#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~63#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~76#1; [2025-03-08 06:29:16,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15872: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~65#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33319: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~133#1;havoc main_~node7__m7~142#1;havoc main_~node6__m6~119#1;havoc main_~node5__m5~107#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~96#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~132#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node7__m7~10#1;havoc main_~node6__m6~9#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20636: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~86#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15355: havoc main_~node7__m7~63#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44426: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4787: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~15#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6902: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~26#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L32803: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~140#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6378: havoc main_~node7__m7~24#1;havoc main_~node6__m6~21#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~33#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29642: havoc main_~node7__m7~126#1;havoc main_~node6__m6~106#1;havoc main_~node5__m5~95#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~85#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~112#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4804: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~17#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25945: havoc main_~node7__m7~109#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~83#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~74#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~96#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25418: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~81#1; [2025-03-08 06:29:16,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20134: havoc main_~node7__m7~84#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~71#1; [2025-03-08 06:29:16,361 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L37046: havoc main_~check__tmp~150#1;havoc main_~node7__m7~159#1;havoc main_~node6__m6~133#1;havoc main_~node5__m5~120#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~107#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~149#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4282: havoc main_~node7__m7~15#1;havoc main_~node6__m6~13#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14324: havoc main_~check__tmp~46#1;havoc main_~node7__m7~58#1;havoc main_~node6__m6~49#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~45#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2697: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~8#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~node7__m7~6#1;havoc main_~node6__m6~6#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44455: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11687: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~34#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13806: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~56#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41818: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1;havoc main_~node7__m7~180#1;havoc main_~node6__m6~151#1;havoc main_~node5__m5~136#1;havoc main_~node4__m4~128#1;havoc main_~node3__m3~124#1;havoc main_~node2__m2~122#1;havoc main_~node1__m1~121#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-08 06:29:16,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25435: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~90#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11704: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~36#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25452: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~107#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13298: havoc main_~node7__m7~54#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~42#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28097: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~85#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36027: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~145#1;havoc main_~node7__m7~154#1;havoc main_~node6__m6~129#1;havoc main_~node5__m5~116#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~105#1;havoc main_~node1__m1~104#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~144#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24930: havoc main_~node7__m7~105#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~72#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~92#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40259: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~145#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11721: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18595: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~65#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11196: havoc main_~check__tmp~35#1;havoc main_~node7__m7~45#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12253: havoc main_~node7__m7~49#1;havoc main_~node6__m6~42#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~39#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40794: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1;havoc main_~node7__m7~175#1;havoc main_~node6__m6~147#1;havoc main_~node5__m5~132#1;havoc main_~node4__m4~125#1;havoc main_~node3__m3~121#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~118#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L35509: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~152#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L32341: havoc main_~check__tmp~127#1;havoc main_~node7__m7~138#1;havoc main_~node6__m6~116#1;havoc main_~node5__m5~104#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~95#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~93#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~126#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28641: havoc main_~node7__m7~121#1;havoc main_~node6__m6~102#1;havoc main_~node5__m5~92#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~83#1;havoc main_~node1__m1~82#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~108#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28114: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~90#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19130: havoc main_~check__tmp~66#1;havoc main_~node7__m7~79#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~60#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40276: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~173#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11738: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~47#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18612: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~77#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38698: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~160#1;havoc main_~node7__m7~166#1;havoc main_~node6__m6~139#1;havoc main_~node5__m5~125#1;havoc main_~node4__m4~118#1;havoc main_~node3__m3~115#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~112#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~159#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28131: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~100#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42930: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~155#1; [2025-03-08 06:29:16,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L43464: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1;havoc main_~node7__m7~187#1;havoc main_~node6__m6~157#1;havoc main_~node5__m5~141#1;havoc main_~node4__m4~133#1;havoc main_~node3__m3~129#1;havoc main_~node2__m2~127#1;havoc main_~node1__m1~126#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-08 06:29:16,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18095: havoc main_~node7__m7~75#1;havoc main_~node6__m6~63#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-08 06:29:16,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38182: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~164#1; [2025-03-08 06:29:16,367 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10172: havoc main_~check__tmp~30#1;havoc main_~node7__m7~40#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~29#1; [2025-03-08 06:29:16,367 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30790: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~99#1; [2025-03-08 06:29:16,367 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23919: havoc main_~node7__m7~100#1;havoc main_~node6__m6~84#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~70#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~89#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28148: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~119#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42947: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~185#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L35021: havoc main_~node7__m7~150#1;havoc main_~node6__m6~126#1;havoc main_~node5__m5~113#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~102#1;havoc main_~node1__m1~101#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~139#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9654: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~38#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17055: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node7__m7~70#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27626: havoc main_~check__tmp~104#1;havoc main_~node7__m7~117#1;havoc main_~node6__m6~98#1;havoc main_~node5__m5~88#1;havoc main_~node4__m4~83#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~79#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~103#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31328: havoc main_~check__tmp~121#1;havoc main_~node7__m7~133#1;havoc main_~node6__m6~112#1;havoc main_~node5__m5~101#1;havoc main_~node4__m4~95#1;havoc main_~node3__m3~92#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~90#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~120#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23404: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~98#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21293: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~75#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30807: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~110#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16537: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~68#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22881: havoc main_~node7__m7~96#1;havoc main_~node6__m6~81#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~65#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~86#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L39794: havoc main_~check__tmp~166#1;havoc main_~node7__m7~171#1;havoc main_~node6__m6~143#1;havoc main_~node5__m5~129#1;havoc main_~node4__m4~122#1;havoc main_~node3__m3~118#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~115#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~165#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21828: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~81#1;havoc main_~node7__m7~91#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~80#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9146: havoc main_~node7__m7~36#1;havoc main_~node6__m6~31#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~26#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33459: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~99#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8091: havoc main_~node7__m7~31#1;havoc main_~node6__m6~27#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21310: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~89#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30824: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~131#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33476: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~102#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16035: havoc main_~node7__m7~66#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~50#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1; [2025-03-08 06:29:16,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7580: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~25#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc main_~check__tmp~16#1;havoc main_~node7__m7~22#1;havoc main_~node6__m6~19#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26616: havoc main_~check__tmp~99#1;havoc main_~node7__m7~112#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~85#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~76#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~98#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34020: havoc main_~node7__m7~145#1;havoc main_~node6__m6~122#1;havoc main_~node5__m5~110#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~99#1;havoc main_~node1__m1~98#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~135#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~20#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L37720: havoc main_~check__tmp~154#1;havoc main_~node7__m7~162#1;havoc main_~node6__m6~136#1;havoc main_~node5__m5~122#1;havoc main_~node4__m4~115#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~109#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~153#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30322: havoc main_~check__tmp~116#1;havoc main_~node7__m7~129#1;havoc main_~node6__m6~108#1;havoc main_~node5__m5~97#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~87#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~115#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33493: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~108#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7597: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~29#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42481: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1;havoc main_~node7__m7~183#1;havoc main_~node6__m6~153#1;havoc main_~node5__m5~138#1;havoc main_~node4__m4~130#1;havoc main_~node3__m3~126#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~123#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7075: havoc main_~node7__m7~27#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15005: havoc main_~node7__m7~61#1;havoc main_~node6__m6~52#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3378: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~9#1; [2025-03-08 06:29:16,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14477: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~45#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33510: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~120#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4972: havoc main_~node7__m7~18#1;havoc main_~node6__m6~16#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20828: havoc main_~check__tmp~75#1;havoc main_~node7__m7~87#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~74#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26113: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~110#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: havoc main_~node7__m7~4#1;havoc main_~node6__m6~4#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41446: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1;havoc main_~node7__m7~178#1;havoc main_~node6__m6~149#1;havoc main_~node5__m5~134#1;havoc main_~node4__m4~127#1;havoc main_~node3__m3~123#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~120#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3395: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~10#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14494: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~50#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: havoc main_~node7__m7~9#1;havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3927: havoc main_~node7__m7~13#1;havoc main_~node6__m6~12#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36169: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~117#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33527: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~143#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13974: havoc main_~node7__m7~57#1;havoc main_~node6__m6~48#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~44#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33001: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~131#1;havoc main_~node7__m7~141#1;havoc main_~node6__m6~118#1;havoc main_~node5__m5~106#1;havoc main_~node4__m4~100#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~95#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~130#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40930: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~176#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36707: havoc main_~check__tmp~148#1;havoc main_~node7__m7~157#1;havoc main_~node6__m6~132#1;havoc main_~node5__m5~119#1;havoc main_~node4__m4~112#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~106#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~147#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19795: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~70#1;havoc main_~node7__m7~82#1;havoc main_~node6__m6~69#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~69#1; [2025-03-08 06:29:16,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44108: havoc main_~node1__m1~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1;havoc main_~node7__m7~190#1;havoc main_~node6__m6~159#1;havoc main_~node5__m5~143#1;havoc main_~node4__m4~135#1;havoc main_~node3__m3~131#1;havoc main_~node2__m2~129#1;havoc main_~node1__m1~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~11#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14511: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~59#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29312: havoc main_~check__tmp~111#1;havoc main_~node7__m7~124#1;havoc main_~node6__m6~104#1;havoc main_~node5__m5~94#1;havoc main_~node4__m4~89#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~84#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~110#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36186: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~130#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12933: havoc main_~node7__m7~52#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~41#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19277: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~80#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25620: havoc main_~node7__m7~108#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~82#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~95#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L43592: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~188#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38835: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~119#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36203: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~155#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28809: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~122#1; [2025-03-08 06:29:16,371 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38852: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~126#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18775: havoc main_~node7__m7~78#1;havoc main_~node6__m6~66#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12435: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~50#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10322: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~35#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24594: havoc main_~node7__m7~103#1;havoc main_~node6__m6~87#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~91#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31993: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~125#1;havoc main_~node7__m7~136#1;havoc main_~node6__m6~114#1;havoc main_~node5__m5~103#1;havoc main_~node4__m4~97#1;havoc main_~node3__m3~94#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~92#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~124#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22480: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~85#1;havoc main_~node7__m7~94#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~84#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11911: havoc main_~node7__m7~48#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~38#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44150: havoc main_~node2__m2~130#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10857: havoc main_~check__tmp~33#1;havoc main_~node7__m7~43#1;havoc main_~node6__m6~37#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~32#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17200: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~51#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38869: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~140#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L35701: havoc main_~check__tmp~143#1;havoc main_~node7__m7~153#1;havoc main_~node6__m6~128#1;havoc main_~node5__m5~115#1;havoc main_~node4__m4~109#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~104#1;havoc main_~node1__m1~103#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~142#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31475: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~134#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21964: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~92#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10339: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~41#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24084: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~85#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40468: havoc main_~check__tmp~170#1;havoc main_~node7__m7~174#1;havoc main_~node6__m6~146#1;havoc main_~node5__m5~131#1;havoc main_~node4__m4~124#1;havoc main_~node3__m3~120#1;havoc main_~node2__m2~118#1;havoc main_~node1__m1~117#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~169#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38886: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~167#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17745: havoc main_~node7__m7~73#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17217: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~54#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28316: havoc main_~node7__m7~120#1;havoc main_~node6__m6~101#1;havoc main_~node5__m5~91#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~81#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~107#1; [2025-03-08 06:29:16,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9822: havoc main_~node7__m7~39#1;havoc main_~node6__m6~33#1;havoc main_~node5__m5~30#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~28#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44182: havoc main_~node3__m3~132#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24101: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~101#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17234: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~60#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23577: havoc main_~node7__m7~99#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~75#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~88#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38380: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~158#1;havoc main_~node7__m7~165#1;havoc main_~node6__m6~138#1;havoc main_~node5__m5~124#1;havoc main_~node4__m4~117#1;havoc main_~node3__m3~114#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~111#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~157#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27287: havoc main_~check__tmp~102#1;havoc main_~node7__m7~115#1;havoc main_~node6__m6~97#1;havoc main_~node5__m5~87#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~78#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~101#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30987: havoc main_~node7__m7~132#1;havoc main_~node6__m6~111#1;havoc main_~node5__m5~100#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~89#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~119#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L43145: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1;havoc main_~node7__m7~186#1;havoc main_~node6__m6~156#1;havoc main_~node5__m5~140#1;havoc main_~node4__m4~132#1;havoc main_~node3__m3~128#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~125#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8791: havoc main_~check__tmp~25#1;havoc main_~node7__m7~34#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34691: havoc main_~check__tmp~138#1;havoc main_~node7__m7~148#1;havoc main_~node6__m6~124#1;havoc main_~node5__m5~112#1;havoc main_~node4__m4~106#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~100#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~137#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17251: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~71#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~17#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26766: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~95#1; [2025-03-08 06:29:16,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16729: havoc main_~check__tmp~56#1;havoc main_~node7__m7~69#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~55#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L39455: havoc main_~check__tmp~164#1;havoc main_~node7__m7~169#1;havoc main_~node6__m6~142#1;havoc main_~node5__m5~128#1;havoc main_~node4__m4~121#1;havoc main_~node3__m3~117#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~114#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~163#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8273: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~32#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44214: havoc main_~node4__m4~136#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41580: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~135#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26783: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~113#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21502: havoc main_~check__tmp~79#1;havoc main_~node7__m7~90#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~78#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34188: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~146#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5648: havoc main_~node7__m7~21#1;havoc main_~node6__m6~18#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7765: havoc main_~node7__m7~30#1;havoc main_~node6__m6~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41597: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~150#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6188: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~20#1; [2025-03-08 06:29:16,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L37372: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~152#1;havoc main_~node7__m7~160#1;havoc main_~node6__m6~134#1;havoc main_~node5__m5~121#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~108#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~151#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6720: havoc main_~node7__m7~25#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc main_~check__tmp~51#1;havoc main_~node7__m7~64#1;havoc main_~node6__m6~54#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4607: havoc main_~node7__m7~16#1;havoc main_~node6__m6~14#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44246: havoc main_~node5__m5~144#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19937: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~63#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26281: havoc main_~node7__m7~111#1;havoc main_~node6__m6~93#1;havoc main_~node5__m5~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~97#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29983: havoc main_~check__tmp~114#1;havoc main_~node7__m7~127#1;havoc main_~node6__m6~107#1;havoc main_~node5__m5~96#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~86#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~113#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36854: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~158#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15187: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~62#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41614: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~179#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6205: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~23#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29462: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~105#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42147: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1;havoc main_~node7__m7~181#1;havoc main_~node6__m6~152#1;havoc main_~node5__m5~137#1;havoc main_~node4__m4~129#1;havoc main_~node3__m3~125#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~122#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-08 06:29:16,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1983: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~5#1; [2025-03-08 06:29:16,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19954: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~70#1; [2025-03-08 06:29:16,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33695: havoc main_~node7__m7~144#1;havoc main_~node6__m6~121#1;havoc main_~node5__m5~109#1;havoc main_~node4__m4~103#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~97#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~134#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~3#1;havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: havoc main_~node7__m7~7#1;havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20489: havoc main_~check__tmp~73#1;havoc main_~node7__m7~85#1;havoc main_~node6__m6~72#1;havoc main_~node5__m5~65#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~72#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~node7__m7~60#1;havoc main_~node6__m6~51#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~14#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29479: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~125#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13624: havoc main_~node7__m7~55#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~43#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3585: havoc main_~node7__m7~12#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~5#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19971: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~83#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L32132: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~115#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11522: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~37#1;havoc main_~node7__m7~46#1;havoc main_~node6__m6~39#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25265: havoc main_~check__tmp~94#1;havoc main_~node7__m7~106#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~80#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~72#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~93#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22623: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~65#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36366: havoc main_~node7__m7~156#1;havoc main_~node6__m6~131#1;havoc main_~node5__m5~118#1;havoc main_~node4__m4~111#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~105#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~146#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L32667: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~129#1;havoc main_~node7__m7~139#1;havoc main_~node6__m6~117#1;havoc main_~node5__m5~105#1;havoc main_~node4__m4~99#1;havoc main_~node3__m3~96#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~94#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~128#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13113: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~45#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L41128: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1;havoc main_~node7__m7~177#1;havoc main_~node6__m6~148#1;havoc main_~node5__m5~133#1;havoc main_~node4__m4~126#1;havoc main_~node3__m3~122#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~119#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11004: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~44#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28977: havoc main_~node7__m7~123#1;havoc main_~node6__m6~103#1;havoc main_~node5__m5~93#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~83#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~109#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L32149: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~137#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22640: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~66#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19469: havoc main_~check__tmp~68#1;havoc main_~node7__m7~81#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~67#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13130: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~53#1; [2025-03-08 06:29:16,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44314: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~160#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24762: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~104#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12608: havoc main_~node7__m7~51#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~35#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~40#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L43793: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1;havoc main_~node7__m7~189#1;havoc main_~node6__m6~158#1;havoc main_~node5__m5~142#1;havoc main_~node4__m4~134#1;havoc main_~node3__m3~130#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~127#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22657: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~68#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10502: havoc main_~node7__m7~42#1;havoc main_~node6__m6~36#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~31#1; [2025-03-08 06:29:16,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27952: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~106#1;havoc main_~node7__m7~118#1;havoc main_~node6__m6~99#1;havoc main_~node5__m5~89#1;havoc main_~node4__m4~84#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~80#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~105#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18445: havoc main_~check__tmp~63#1;havoc main_~node7__m7~76#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44342: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22674: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~72#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L35362: havoc main_~check__tmp~141#1;havoc main_~node7__m7~151#1;havoc main_~node6__m6~127#1;havoc main_~node5__m5~114#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~105#1;havoc main_~node2__m2~103#1;havoc main_~node1__m1~102#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~140#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27434: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~116#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L40120: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~168#1;havoc main_~node7__m7~172#1;havoc main_~node6__m6~144#1;havoc main_~node5__m5~130#1;havoc main_~node4__m4~123#1;havoc main_~node3__m3~119#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~116#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~167#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31667: havoc main_~check__tmp~123#1;havoc main_~node7__m7~135#1;havoc main_~node6__m6~113#1;havoc main_~node5__m5~102#1;havoc main_~node4__m4~96#1;havoc main_~node3__m3~93#1;havoc main_~node2__m2~92#1;havoc main_~node1__m1~91#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~122#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17927: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~74#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24269: havoc main_~node7__m7~102#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~73#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~90#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9472: havoc main_~node7__m7~37#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~27#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8944: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~27#1; [2025-03-08 06:29:16,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34841: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~125#1; [2025-03-08 06:29:16,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L39602: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~170#1; [2025-03-08 06:29:16,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22162: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~83#1;havoc main_~node7__m7~93#1;havoc main_~node6__m6~78#1;havoc main_~node5__m5~70#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~82#1; [2025-03-08 06:29:16,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22691: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~80#1; [2025-03-08 06:29:16,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23223: havoc main_~node7__m7~97#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~87#1; [2025-03-08 06:29:16,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:29:17,334 INFO L? ?]: Removed 4832 outVars from TransFormulas that were not future-live. [2025-03-08 06:29:17,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:29:17,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:29:17,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:29:17,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:17 BoogieIcfgContainer [2025-03-08 06:29:17,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:29:17,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:29:17,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:29:17,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:29:17,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:29:04" (1/3) ... [2025-03-08 06:29:17,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2f2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:17, skipping insertion in model container [2025-03-08 06:29:17,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:07" (2/3) ... [2025-03-08 06:29:17,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2f2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:17, skipping insertion in model container [2025-03-08 06:29:17,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:17" (3/3) ... [2025-03-08 06:29:17,411 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:29:17,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:29:17,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 5023 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-08 06:29:17,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:29:17,549 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;@7e70c391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:29:17,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 06:29:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 5023 states, 4993 states have (on average 1.8155417584618465) internal successors, (9065), 5022 states have internal predecessors, (9065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:29:17,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:17,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:17,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2145942462, now seen corresponding path program 1 times [2025-03-08 06:29:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598676389] [2025-03-08 06:29:17,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:17,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:17,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:29:17,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:29:17,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598676389] [2025-03-08 06:29:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598676389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556201296] [2025-03-08 06:29:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:18,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:18,238 INFO L87 Difference]: Start difference. First operand has 5023 states, 4993 states have (on average 1.8155417584618465) internal successors, (9065), 5022 states have internal predecessors, (9065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,150 INFO L93 Difference]: Finished difference Result 6067 states and 10810 transitions. [2025-03-08 06:29:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:29:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,173 INFO L225 Difference]: With dead ends: 6067 [2025-03-08 06:29:21,174 INFO L226 Difference]: Without dead ends: 3560 [2025-03-08 06:29:21,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:21,183 INFO L435 NwaCegarLoop]: 3236 mSDtfsCounter, 18771 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18771 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:21,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18771 Valid, 3282 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 06:29:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-03-08 06:29:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3560. [2025-03-08 06:29:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3531 states have (on average 1.334749362786746) internal successors, (4713), 3559 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4713 transitions. [2025-03-08 06:29:21,321 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4713 transitions. Word has length 101 [2025-03-08 06:29:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 3560 states and 4713 transitions. [2025-03-08 06:29:21,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4713 transitions. [2025-03-08 06:29:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:29:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:29:21,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash 794075970, now seen corresponding path program 1 times [2025-03-08 06:29:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600772027] [2025-03-08 06:29:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:21,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:29:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:29:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600772027] [2025-03-08 06:29:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600772027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260522912] [2025-03-08 06:29:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:21,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:21,573 INFO L87 Difference]: Start difference. First operand 3560 states and 4713 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,930 INFO L93 Difference]: Finished difference Result 4083 states and 5368 transitions. [2025-03-08 06:29:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:22,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:29:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,937 INFO L225 Difference]: With dead ends: 4083 [2025-03-08 06:29:22,937 INFO L226 Difference]: Without dead ends: 2336 [2025-03-08 06:29:22,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:22,940 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 9223 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9223 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9223 Valid, 1406 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-08 06:29:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2025-03-08 06:29:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2307 states have (on average 1.3524057217165149) internal successors, (3120), 2335 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3120 transitions. [2025-03-08 06:29:22,974 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3120 transitions. Word has length 101 [2025-03-08 06:29:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,975 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3120 transitions. [2025-03-08 06:29:22,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3120 transitions. [2025-03-08 06:29:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:29:22,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:29:22,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:22,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1788268636, now seen corresponding path program 1 times [2025-03-08 06:29:22,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269062677] [2025-03-08 06:29:22,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:29:23,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:29:23,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:23,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269062677] [2025-03-08 06:29:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269062677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097442975] [2025-03-08 06:29:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:23,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:23,186 INFO L87 Difference]: Start difference. First operand 2336 states and 3120 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,047 INFO L93 Difference]: Finished difference Result 3019 states and 4030 transitions. [2025-03-08 06:29:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:24,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:29:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,053 INFO L225 Difference]: With dead ends: 3019 [2025-03-08 06:29:24,053 INFO L226 Difference]: Without dead ends: 1840 [2025-03-08 06:29:24,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:24,055 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 7351 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7351 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7351 Valid, 1190 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-08 06:29:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2025-03-08 06:29:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1811 states have (on average 1.3732744340143568) internal successors, (2487), 1839 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2487 transitions. [2025-03-08 06:29:24,078 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2487 transitions. Word has length 101 [2025-03-08 06:29:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,079 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2487 transitions. [2025-03-08 06:29:24,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2487 transitions. [2025-03-08 06:29:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:29:24,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:29:24,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1414816462, now seen corresponding path program 1 times [2025-03-08 06:29:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244384907] [2025-03-08 06:29:24,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:29:24,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:29:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244384907] [2025-03-08 06:29:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244384907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225038028] [2025-03-08 06:29:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:24,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:24,265 INFO L87 Difference]: Start difference. First operand 1840 states and 2487 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,830 INFO L93 Difference]: Finished difference Result 2097 states and 2778 transitions. [2025-03-08 06:29:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 06:29:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,833 INFO L225 Difference]: With dead ends: 2097 [2025-03-08 06:29:24,833 INFO L226 Difference]: Without dead ends: 1219 [2025-03-08 06:29:24,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:24,835 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 4802 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4802 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4802 Valid, 835 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-08 06:29:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2025-03-08 06:29:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1190 states have (on average 1.3865546218487395) internal successors, (1650), 1218 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1650 transitions. [2025-03-08 06:29:24,849 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1650 transitions. Word has length 102 [2025-03-08 06:29:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,849 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1650 transitions. [2025-03-08 06:29:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1650 transitions. [2025-03-08 06:29:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:29:24,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:29:24,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2122887825, now seen corresponding path program 1 times [2025-03-08 06:29:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594684161] [2025-03-08 06:29:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:29:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:29:24,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594684161] [2025-03-08 06:29:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594684161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698805887] [2025-03-08 06:29:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:24,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:24,994 INFO L87 Difference]: Start difference. First operand 1219 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:25,479 INFO L93 Difference]: Finished difference Result 1786 states and 2430 transitions. [2025-03-08 06:29:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 06:29:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:25,482 INFO L225 Difference]: With dead ends: 1786 [2025-03-08 06:29:25,482 INFO L226 Difference]: Without dead ends: 1125 [2025-03-08 06:29:25,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:25,484 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4542 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:25,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 848 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-08 06:29:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2025-03-08 06:29:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1096 states have (on average 1.4041970802919708) internal successors, (1539), 1124 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1539 transitions. [2025-03-08 06:29:25,495 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1539 transitions. Word has length 103 [2025-03-08 06:29:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:25,495 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1539 transitions. [2025-03-08 06:29:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1539 transitions. [2025-03-08 06:29:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:29:25,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:25,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:25,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:29:25,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 662969568, now seen corresponding path program 1 times [2025-03-08 06:29:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854773071] [2025-03-08 06:29:25,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:25,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:29:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:29:25,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854773071] [2025-03-08 06:29:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854773071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116509873] [2025-03-08 06:29:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:25,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:25,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:25,624 INFO L87 Difference]: Start difference. First operand 1125 states and 1539 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,473 INFO L93 Difference]: Finished difference Result 2281 states and 3139 transitions. [2025-03-08 06:29:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 06:29:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,477 INFO L225 Difference]: With dead ends: 2281 [2025-03-08 06:29:26,478 INFO L226 Difference]: Without dead ends: 1666 [2025-03-08 06:29:26,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:26,479 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 6015 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6015 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6015 Valid, 1267 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-08 06:29:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1564. [2025-03-08 06:29:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1535 states have (on average 1.441042345276873) internal successors, (2212), 1563 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2212 transitions. [2025-03-08 06:29:26,500 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2212 transitions. Word has length 104 [2025-03-08 06:29:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,500 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2212 transitions. [2025-03-08 06:29:26,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2212 transitions. [2025-03-08 06:29:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:29:26,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:29:26,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1079513908, now seen corresponding path program 1 times [2025-03-08 06:29:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427099811] [2025-03-08 06:29:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:29:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:29:26,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427099811] [2025-03-08 06:29:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427099811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240274739] [2025-03-08 06:29:26,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:26,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:26,639 INFO L87 Difference]: Start difference. First operand 1564 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,331 INFO L93 Difference]: Finished difference Result 2228 states and 3140 transitions. [2025-03-08 06:29:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:27,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-08 06:29:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,334 INFO L225 Difference]: With dead ends: 2228 [2025-03-08 06:29:27,334 INFO L226 Difference]: Without dead ends: 1556 [2025-03-08 06:29:27,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:27,336 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 4254 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4254 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4254 Valid, 649 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-08 06:29:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-03-08 06:29:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.441388343156516) internal successors, (2201), 1555 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2201 transitions. [2025-03-08 06:29:27,355 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2201 transitions. Word has length 105 [2025-03-08 06:29:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,356 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2201 transitions. [2025-03-08 06:29:27,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2201 transitions. [2025-03-08 06:29:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:27,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:27,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:29:27,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 991030886, now seen corresponding path program 1 times [2025-03-08 06:29:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234961442] [2025-03-08 06:29:27,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:27,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:27,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234961442] [2025-03-08 06:29:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234961442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:29:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246611707] [2025-03-08 06:29:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:27,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:29:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:29:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:29:27,810 INFO L87 Difference]: Start difference. First operand 1556 states and 2201 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:29,379 INFO L93 Difference]: Finished difference Result 2847 states and 4035 transitions. [2025-03-08 06:29:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:29,386 INFO L225 Difference]: With dead ends: 2847 [2025-03-08 06:29:29,386 INFO L226 Difference]: Without dead ends: 2427 [2025-03-08 06:29:29,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:29,392 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 6239 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6239 SdHoareTripleChecker+Valid, 4338 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:29,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6239 Valid, 4338 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2025-03-08 06:29:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1556. [2025-03-08 06:29:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4400785854616895) internal successors, (2199), 1555 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2199 transitions. [2025-03-08 06:29:29,422 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2199 transitions. Word has length 106 [2025-03-08 06:29:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:29,422 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2199 transitions. [2025-03-08 06:29:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2199 transitions. [2025-03-08 06:29:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:29,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:29,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:29,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:29:29,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -612833560, now seen corresponding path program 1 times [2025-03-08 06:29:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512634687] [2025-03-08 06:29:29,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:29,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:29,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:29,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:29,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512634687] [2025-03-08 06:29:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512634687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:29:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913458899] [2025-03-08 06:29:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:29,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:29:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:29,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:29:29,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:29:29,845 INFO L87 Difference]: Start difference. First operand 1556 states and 2199 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:31,509 INFO L93 Difference]: Finished difference Result 2518 states and 3543 transitions. [2025-03-08 06:29:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:31,513 INFO L225 Difference]: With dead ends: 2518 [2025-03-08 06:29:31,513 INFO L226 Difference]: Without dead ends: 2328 [2025-03-08 06:29:31,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:31,514 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 6780 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6780 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:31,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6780 Valid, 4644 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:29:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2025-03-08 06:29:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1556. [2025-03-08 06:29:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.438768827766863) internal successors, (2197), 1555 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2197 transitions. [2025-03-08 06:29:31,533 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2197 transitions. Word has length 106 [2025-03-08 06:29:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:31,533 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2197 transitions. [2025-03-08 06:29:31,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2197 transitions. [2025-03-08 06:29:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:31,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:31,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:31,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:29:31,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 452961098, now seen corresponding path program 1 times [2025-03-08 06:29:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918284649] [2025-03-08 06:29:31,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:31,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:31,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:31,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:31,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:31,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:31,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918284649] [2025-03-08 06:29:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918284649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:29:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457118921] [2025-03-08 06:29:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:31,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:29:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:29:31,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:29:31,875 INFO L87 Difference]: Start difference. First operand 1556 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:33,085 INFO L93 Difference]: Finished difference Result 2679 states and 3659 transitions. [2025-03-08 06:29:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:29:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:33,090 INFO L225 Difference]: With dead ends: 2679 [2025-03-08 06:29:33,090 INFO L226 Difference]: Without dead ends: 2015 [2025-03-08 06:29:33,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:33,091 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 6627 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6627 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:33,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6627 Valid, 2194 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-03-08 06:29:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1556. [2025-03-08 06:29:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4381139489194499) internal successors, (2196), 1555 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2196 transitions. [2025-03-08 06:29:33,110 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2196 transitions. Word has length 106 [2025-03-08 06:29:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2196 transitions. [2025-03-08 06:29:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2196 transitions. [2025-03-08 06:29:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:33,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:33,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:33,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:29:33,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2072095560, now seen corresponding path program 1 times [2025-03-08 06:29:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131309967] [2025-03-08 06:29:33,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:33,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:33,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:33,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:33,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131309967] [2025-03-08 06:29:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131309967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803316092] [2025-03-08 06:29:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:33,513 INFO L87 Difference]: Start difference. First operand 1556 states and 2196 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:35,263 INFO L93 Difference]: Finished difference Result 2617 states and 3686 transitions. [2025-03-08 06:29:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:35,275 INFO L225 Difference]: With dead ends: 2617 [2025-03-08 06:29:35,275 INFO L226 Difference]: Without dead ends: 2417 [2025-03-08 06:29:35,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 06:29:35,277 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 3904 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 4131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3904 SdHoareTripleChecker+Valid, 4699 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:35,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3904 Valid, 4699 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4131 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:29:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-03-08 06:29:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1571. [2025-03-08 06:29:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4377431906614786) internal successors, (2217), 1570 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2217 transitions. [2025-03-08 06:29:35,299 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2217 transitions. Word has length 106 [2025-03-08 06:29:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:35,299 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2217 transitions. [2025-03-08 06:29:35,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2217 transitions. [2025-03-08 06:29:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:35,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:35,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:29:35,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:35,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash 217540033, now seen corresponding path program 1 times [2025-03-08 06:29:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234175653] [2025-03-08 06:29:35,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:35,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:35,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234175653] [2025-03-08 06:29:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234175653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970760611] [2025-03-08 06:29:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:35,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:35,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:35,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:35,679 INFO L87 Difference]: Start difference. First operand 1571 states and 2217 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:37,249 INFO L93 Difference]: Finished difference Result 2580 states and 3618 transitions. [2025-03-08 06:29:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:37,255 INFO L225 Difference]: With dead ends: 2580 [2025-03-08 06:29:37,255 INFO L226 Difference]: Without dead ends: 2402 [2025-03-08 06:29:37,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:29:37,256 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 9818 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9818 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:37,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9818 Valid, 4303 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-03-08 06:29:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1575. [2025-03-08 06:29:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4379042690815007) internal successors, (2223), 1574 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2223 transitions. [2025-03-08 06:29:37,279 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2223 transitions. Word has length 106 [2025-03-08 06:29:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:37,279 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2223 transitions. [2025-03-08 06:29:37,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2223 transitions. [2025-03-08 06:29:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:37,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:37,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:37,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:29:37,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1203081725, now seen corresponding path program 1 times [2025-03-08 06:29:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848115408] [2025-03-08 06:29:37,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:37,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:37,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:37,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:37,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:37,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848115408] [2025-03-08 06:29:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848115408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:37,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:37,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755726438] [2025-03-08 06:29:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:37,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:37,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:37,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:37,551 INFO L87 Difference]: Start difference. First operand 1575 states and 2223 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,641 INFO L93 Difference]: Finished difference Result 2028 states and 2883 transitions. [2025-03-08 06:29:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,645 INFO L225 Difference]: With dead ends: 2028 [2025-03-08 06:29:38,645 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:38,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:38,646 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 5373 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5373 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5373 Valid, 3769 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1556. [2025-03-08 06:29:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4374590700720367) internal successors, (2195), 1555 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2195 transitions. [2025-03-08 06:29:38,662 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2195 transitions. Word has length 106 [2025-03-08 06:29:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2195 transitions. [2025-03-08 06:29:38,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2195 transitions. [2025-03-08 06:29:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:38,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:29:38,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1488662017, now seen corresponding path program 1 times [2025-03-08 06:29:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293965066] [2025-03-08 06:29:38,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:38,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:38,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293965066] [2025-03-08 06:29:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293965066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050345521] [2025-03-08 06:29:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:38,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:38,879 INFO L87 Difference]: Start difference. First operand 1556 states and 2195 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,146 INFO L93 Difference]: Finished difference Result 2620 states and 3709 transitions. [2025-03-08 06:29:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,153 INFO L225 Difference]: With dead ends: 2620 [2025-03-08 06:29:40,153 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:29:40,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:40,154 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 3622 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3622 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3622 Valid, 4006 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:29:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:29:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4368041912246234) internal successors, (2194), 1555 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2194 transitions. [2025-03-08 06:29:40,168 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2194 transitions. Word has length 106 [2025-03-08 06:29:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,168 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2194 transitions. [2025-03-08 06:29:40,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2194 transitions. [2025-03-08 06:29:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:40,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:29:40,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash -588440999, now seen corresponding path program 1 times [2025-03-08 06:29:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841540510] [2025-03-08 06:29:40,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:40,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:40,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841540510] [2025-03-08 06:29:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841540510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496360103] [2025-03-08 06:29:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:40,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:40,395 INFO L87 Difference]: Start difference. First operand 1556 states and 2194 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:41,459 INFO L93 Difference]: Finished difference Result 2379 states and 3371 transitions. [2025-03-08 06:29:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:41,463 INFO L225 Difference]: With dead ends: 2379 [2025-03-08 06:29:41,463 INFO L226 Difference]: Without dead ends: 1729 [2025-03-08 06:29:41,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:41,465 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 4109 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:41,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 3731 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-08 06:29:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1556. [2025-03-08 06:29:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.435494433529797) internal successors, (2192), 1555 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2192 transitions. [2025-03-08 06:29:41,483 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2192 transitions. Word has length 108 [2025-03-08 06:29:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:41,483 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2192 transitions. [2025-03-08 06:29:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2192 transitions. [2025-03-08 06:29:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:41,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:41,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:41,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:29:41,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 932754200, now seen corresponding path program 1 times [2025-03-08 06:29:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909665847] [2025-03-08 06:29:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:41,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909665847] [2025-03-08 06:29:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909665847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:41,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075566903] [2025-03-08 06:29:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:41,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:41,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:41,692 INFO L87 Difference]: Start difference. First operand 1556 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:43,131 INFO L93 Difference]: Finished difference Result 2799 states and 3964 transitions. [2025-03-08 06:29:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:43,136 INFO L225 Difference]: With dead ends: 2799 [2025-03-08 06:29:43,136 INFO L226 Difference]: Without dead ends: 2431 [2025-03-08 06:29:43,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:43,137 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 5976 mSDsluCounter, 4056 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 5291 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:43,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 5291 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-08 06:29:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1556. [2025-03-08 06:29:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4341846758349706) internal successors, (2190), 1555 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2190 transitions. [2025-03-08 06:29:43,155 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2190 transitions. Word has length 108 [2025-03-08 06:29:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2190 transitions. [2025-03-08 06:29:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2190 transitions. [2025-03-08 06:29:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:43,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:43,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:43,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:29:43,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:43,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1320089639, now seen corresponding path program 1 times [2025-03-08 06:29:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254840208] [2025-03-08 06:29:43,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:43,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:43,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:43,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254840208] [2025-03-08 06:29:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254840208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:43,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969933380] [2025-03-08 06:29:43,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:43,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:43,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:43,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:43,376 INFO L87 Difference]: Start difference. First operand 1556 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:44,613 INFO L93 Difference]: Finished difference Result 2664 states and 3768 transitions. [2025-03-08 06:29:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:44,617 INFO L225 Difference]: With dead ends: 2664 [2025-03-08 06:29:44,617 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:29:44,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:44,618 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 5341 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:44,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 4345 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:29:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:29:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4328749181401441) internal successors, (2188), 1555 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2188 transitions. [2025-03-08 06:29:44,638 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2188 transitions. Word has length 108 [2025-03-08 06:29:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:44,638 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2188 transitions. [2025-03-08 06:29:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2188 transitions. [2025-03-08 06:29:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:44,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:44,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:29:44,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2102697192, now seen corresponding path program 1 times [2025-03-08 06:29:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961299997] [2025-03-08 06:29:44,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:44,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:44,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961299997] [2025-03-08 06:29:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961299997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:45,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:45,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891536591] [2025-03-08 06:29:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:45,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:45,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:45,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:45,040 INFO L87 Difference]: Start difference. First operand 1556 states and 2188 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:47,254 INFO L93 Difference]: Finished difference Result 3435 states and 4910 transitions. [2025-03-08 06:29:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:47,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:47,260 INFO L225 Difference]: With dead ends: 3435 [2025-03-08 06:29:47,261 INFO L226 Difference]: Without dead ends: 3151 [2025-03-08 06:29:47,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:47,262 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 10015 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 5632 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10015 SdHoareTripleChecker+Valid, 6665 SdHoareTripleChecker+Invalid, 5934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 5632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:47,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10015 Valid, 6665 Invalid, 5934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 5632 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:29:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2025-03-08 06:29:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1560. [2025-03-08 06:29:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4317439581972566) internal successors, (2192), 1559 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2192 transitions. [2025-03-08 06:29:47,292 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2192 transitions. Word has length 108 [2025-03-08 06:29:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:47,292 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2192 transitions. [2025-03-08 06:29:47,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2192 transitions. [2025-03-08 06:29:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:47,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:47,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:47,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:29:47,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 453524738, now seen corresponding path program 1 times [2025-03-08 06:29:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24505223] [2025-03-08 06:29:47,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:47,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:47,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:47,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:47,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:47,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24505223] [2025-03-08 06:29:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24505223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535422596] [2025-03-08 06:29:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:47,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:47,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:47,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:47,559 INFO L87 Difference]: Start difference. First operand 1560 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:48,844 INFO L93 Difference]: Finished difference Result 2575 states and 3626 transitions. [2025-03-08 06:29:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:48,848 INFO L225 Difference]: With dead ends: 2575 [2025-03-08 06:29:48,848 INFO L226 Difference]: Without dead ends: 2384 [2025-03-08 06:29:48,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:48,849 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 5698 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5698 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:48,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5698 Valid, 3771 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-03-08 06:29:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1560. [2025-03-08 06:29:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4310907903331156) internal successors, (2191), 1559 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2191 transitions. [2025-03-08 06:29:48,869 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2191 transitions. Word has length 108 [2025-03-08 06:29:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:48,869 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2191 transitions. [2025-03-08 06:29:48,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2191 transitions. [2025-03-08 06:29:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:48,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:48,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:48,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:29:48,871 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1608586926, now seen corresponding path program 1 times [2025-03-08 06:29:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709682479] [2025-03-08 06:29:48,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:48,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:48,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709682479] [2025-03-08 06:29:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709682479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299400271] [2025-03-08 06:29:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:49,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:49,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:49,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:49,090 INFO L87 Difference]: Start difference. First operand 1560 states and 2191 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:50,170 INFO L93 Difference]: Finished difference Result 2252 states and 3104 transitions. [2025-03-08 06:29:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:50,174 INFO L225 Difference]: With dead ends: 2252 [2025-03-08 06:29:50,174 INFO L226 Difference]: Without dead ends: 2247 [2025-03-08 06:29:50,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:50,175 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 6036 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6036 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:50,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6036 Valid, 3149 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2025-03-08 06:29:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1560. [2025-03-08 06:29:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4304376224689745) internal successors, (2190), 1559 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2190 transitions. [2025-03-08 06:29:50,191 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2190 transitions. Word has length 108 [2025-03-08 06:29:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:50,191 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2190 transitions. [2025-03-08 06:29:50,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2190 transitions. [2025-03-08 06:29:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:50,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:50,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:50,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:29:50,193 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:50,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 886979186, now seen corresponding path program 1 times [2025-03-08 06:29:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361646639] [2025-03-08 06:29:50,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:50,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:50,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361646639] [2025-03-08 06:29:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361646639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180552332] [2025-03-08 06:29:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:50,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:50,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:50,388 INFO L87 Difference]: Start difference. First operand 1560 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:51,710 INFO L93 Difference]: Finished difference Result 2695 states and 3812 transitions. [2025-03-08 06:29:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:51,715 INFO L225 Difference]: With dead ends: 2695 [2025-03-08 06:29:51,715 INFO L226 Difference]: Without dead ends: 2431 [2025-03-08 06:29:51,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:51,716 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 4076 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 3832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:51,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 4741 Invalid, 3832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-08 06:29:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1560. [2025-03-08 06:29:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4297844546048335) internal successors, (2189), 1559 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2189 transitions. [2025-03-08 06:29:51,732 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2189 transitions. Word has length 108 [2025-03-08 06:29:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:51,732 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2189 transitions. [2025-03-08 06:29:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2189 transitions. [2025-03-08 06:29:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:51,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:51,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:29:51,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 629004595, now seen corresponding path program 1 times [2025-03-08 06:29:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:51,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053225555] [2025-03-08 06:29:51,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:51,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:51,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:51,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:51,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053225555] [2025-03-08 06:29:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053225555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964243970] [2025-03-08 06:29:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:51,928 INFO L87 Difference]: Start difference. First operand 1560 states and 2189 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:53,155 INFO L93 Difference]: Finished difference Result 2510 states and 3515 transitions. [2025-03-08 06:29:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:53,159 INFO L225 Difference]: With dead ends: 2510 [2025-03-08 06:29:53,159 INFO L226 Difference]: Without dead ends: 2336 [2025-03-08 06:29:53,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:53,161 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 7996 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 2985 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7996 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:53,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7996 Valid, 3440 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2985 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-08 06:29:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1560. [2025-03-08 06:29:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.4291312867406925) internal successors, (2188), 1559 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2188 transitions. [2025-03-08 06:29:53,176 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2188 transitions. Word has length 108 [2025-03-08 06:29:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:53,176 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2188 transitions. [2025-03-08 06:29:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2188 transitions. [2025-03-08 06:29:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:53,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:53,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:53,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:29:53,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1874781172, now seen corresponding path program 1 times [2025-03-08 06:29:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709107725] [2025-03-08 06:29:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:53,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:53,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:53,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709107725] [2025-03-08 06:29:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709107725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:53,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333040934] [2025-03-08 06:29:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:53,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:53,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:53,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:53,390 INFO L87 Difference]: Start difference. First operand 1560 states and 2188 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:54,953 INFO L93 Difference]: Finished difference Result 2715 states and 3832 transitions. [2025-03-08 06:29:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-08 06:29:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:54,956 INFO L225 Difference]: With dead ends: 2715 [2025-03-08 06:29:54,956 INFO L226 Difference]: Without dead ends: 2431 [2025-03-08 06:29:54,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:54,957 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 4483 mSDsluCounter, 4962 mSDsCounter, 0 mSdLazyCounter, 4974 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:54,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 6199 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4974 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-08 06:29:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1556. [2025-03-08 06:29:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.429600523903078) internal successors, (2183), 1555 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2183 transitions. [2025-03-08 06:29:54,969 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2183 transitions. Word has length 109 [2025-03-08 06:29:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:54,970 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2183 transitions. [2025-03-08 06:29:54,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2183 transitions. [2025-03-08 06:29:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:54,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:54,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:29:54,971 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -974575062, now seen corresponding path program 1 times [2025-03-08 06:29:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975618108] [2025-03-08 06:29:54,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:55,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:55,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:55,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975618108] [2025-03-08 06:29:55,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975618108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:55,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:55,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342347842] [2025-03-08 06:29:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:55,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:55,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:55,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:55,187 INFO L87 Difference]: Start difference. First operand 1556 states and 2183 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:56,701 INFO L93 Difference]: Finished difference Result 2684 states and 3781 transitions. [2025-03-08 06:29:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:56,704 INFO L225 Difference]: With dead ends: 2684 [2025-03-08 06:29:56,704 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:29:56,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:56,706 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 6045 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 4811 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6045 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:56,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6045 Valid, 5866 Invalid, 4818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4811 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:29:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:29:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4282907662082516) internal successors, (2181), 1555 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2181 transitions. [2025-03-08 06:29:56,720 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2181 transitions. Word has length 110 [2025-03-08 06:29:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:56,721 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2181 transitions. [2025-03-08 06:29:56,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2181 transitions. [2025-03-08 06:29:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:56,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:56,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:29:56,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1527538036, now seen corresponding path program 1 times [2025-03-08 06:29:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655153402] [2025-03-08 06:29:56,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:56,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:56,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:56,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:56,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655153402] [2025-03-08 06:29:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655153402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986076002] [2025-03-08 06:29:56,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:56,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:56,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:56,913 INFO L87 Difference]: Start difference. First operand 1556 states and 2181 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:58,078 INFO L93 Difference]: Finished difference Result 2417 states and 3348 transitions. [2025-03-08 06:29:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:58,081 INFO L225 Difference]: With dead ends: 2417 [2025-03-08 06:29:58,081 INFO L226 Difference]: Without dead ends: 2243 [2025-03-08 06:29:58,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:58,081 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 5990 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5990 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:58,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5990 Valid, 3169 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-08 06:29:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-08 06:29:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.426981008513425) internal successors, (2179), 1555 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2179 transitions. [2025-03-08 06:29:58,095 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2179 transitions. Word has length 110 [2025-03-08 06:29:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2179 transitions. [2025-03-08 06:29:58,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2179 transitions. [2025-03-08 06:29:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:58,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:58,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:58,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:29:58,097 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:58,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1348385272, now seen corresponding path program 1 times [2025-03-08 06:29:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303307622] [2025-03-08 06:29:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:58,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:58,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:58,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:58,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303307622] [2025-03-08 06:29:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303307622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070874537] [2025-03-08 06:29:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:58,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:58,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:58,281 INFO L87 Difference]: Start difference. First operand 1556 states and 2179 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:59,592 INFO L93 Difference]: Finished difference Result 2668 states and 3754 transitions. [2025-03-08 06:29:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:59,594 INFO L225 Difference]: With dead ends: 2668 [2025-03-08 06:29:59,594 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:29:59,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:59,595 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 6237 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6237 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:59,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6237 Valid, 4978 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:29:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:29:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4256712508185985) internal successors, (2177), 1555 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2177 transitions. [2025-03-08 06:29:59,609 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2177 transitions. Word has length 110 [2025-03-08 06:29:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:59,609 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2177 transitions. [2025-03-08 06:29:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2177 transitions. [2025-03-08 06:29:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:59,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:59,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:59,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:29:59,611 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash 920215290, now seen corresponding path program 1 times [2025-03-08 06:29:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568070569] [2025-03-08 06:29:59,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:59,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:59,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:59,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:59,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568070569] [2025-03-08 06:29:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568070569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482556335] [2025-03-08 06:29:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:59,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:59,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:59,811 INFO L87 Difference]: Start difference. First operand 1556 states and 2177 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:01,159 INFO L93 Difference]: Finished difference Result 2590 states and 3635 transitions. [2025-03-08 06:30:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:01,162 INFO L225 Difference]: With dead ends: 2590 [2025-03-08 06:30:01,162 INFO L226 Difference]: Without dead ends: 2380 [2025-03-08 06:30:01,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:01,163 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 4950 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 4149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:01,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 5005 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-08 06:30:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-08 06:30:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.424361493123772) internal successors, (2175), 1555 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2175 transitions. [2025-03-08 06:30:01,211 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2175 transitions. Word has length 110 [2025-03-08 06:30:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:01,211 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2175 transitions. [2025-03-08 06:30:01,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2175 transitions. [2025-03-08 06:30:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:01,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:01,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:30:01,213 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1270637768, now seen corresponding path program 1 times [2025-03-08 06:30:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831091244] [2025-03-08 06:30:01,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:01,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:01,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831091244] [2025-03-08 06:30:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831091244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308957290] [2025-03-08 06:30:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:01,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:01,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:01,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:01,433 INFO L87 Difference]: Start difference. First operand 1556 states and 2175 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:02,671 INFO L93 Difference]: Finished difference Result 2590 states and 3633 transitions. [2025-03-08 06:30:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:02,674 INFO L225 Difference]: With dead ends: 2590 [2025-03-08 06:30:02,674 INFO L226 Difference]: Without dead ends: 2380 [2025-03-08 06:30:02,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:02,675 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 5379 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5379 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:02,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5379 Valid, 4135 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-08 06:30:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-08 06:30:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4230517354289456) internal successors, (2173), 1555 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2173 transitions. [2025-03-08 06:30:02,687 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2173 transitions. Word has length 110 [2025-03-08 06:30:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:02,687 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2173 transitions. [2025-03-08 06:30:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2173 transitions. [2025-03-08 06:30:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:02,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:02,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:02,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:30:02,689 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:02,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 305779289, now seen corresponding path program 1 times [2025-03-08 06:30:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104834833] [2025-03-08 06:30:02,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:02,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:02,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:02,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104834833] [2025-03-08 06:30:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104834833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682591718] [2025-03-08 06:30:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:02,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:02,870 INFO L87 Difference]: Start difference. First operand 1556 states and 2173 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:03,916 INFO L93 Difference]: Finished difference Result 2413 states and 3333 transitions. [2025-03-08 06:30:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:03,918 INFO L225 Difference]: With dead ends: 2413 [2025-03-08 06:30:03,918 INFO L226 Difference]: Without dead ends: 2243 [2025-03-08 06:30:03,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:03,919 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 5974 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5974 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:03,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5974 Valid, 3169 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2897 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:30:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-08 06:30:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-08 06:30:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4217419777341191) internal successors, (2171), 1555 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2171 transitions. [2025-03-08 06:30:03,932 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2171 transitions. Word has length 110 [2025-03-08 06:30:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2171 transitions. [2025-03-08 06:30:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2171 transitions. [2025-03-08 06:30:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:03,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:03,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:03,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:30:03,934 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:03,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2127607784, now seen corresponding path program 1 times [2025-03-08 06:30:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804965405] [2025-03-08 06:30:03,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:03,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:03,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804965405] [2025-03-08 06:30:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804965405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760190090] [2025-03-08 06:30:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:04,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:04,152 INFO L87 Difference]: Start difference. First operand 1556 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:05,496 INFO L93 Difference]: Finished difference Result 2634 states and 3693 transitions. [2025-03-08 06:30:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:05,499 INFO L225 Difference]: With dead ends: 2634 [2025-03-08 06:30:05,499 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:30:05,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:05,500 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 3024 mSDsluCounter, 3955 mSDsCounter, 0 mSdLazyCounter, 4280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3024 SdHoareTripleChecker+Valid, 5164 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:05,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3024 Valid, 5164 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:30:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:30:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.421087098886706) internal successors, (2170), 1555 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2170 transitions. [2025-03-08 06:30:05,513 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2170 transitions. Word has length 110 [2025-03-08 06:30:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2170 transitions. [2025-03-08 06:30:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2170 transitions. [2025-03-08 06:30:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:05,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:05,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:30:05,515 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1147569501, now seen corresponding path program 1 times [2025-03-08 06:30:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769428488] [2025-03-08 06:30:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:05,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:05,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:05,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:05,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769428488] [2025-03-08 06:30:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769428488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623168786] [2025-03-08 06:30:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:05,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:05,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:05,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:05,707 INFO L87 Difference]: Start difference. First operand 1556 states and 2170 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:06,942 INFO L93 Difference]: Finished difference Result 2571 states and 3599 transitions. [2025-03-08 06:30:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:06,944 INFO L225 Difference]: With dead ends: 2571 [2025-03-08 06:30:06,944 INFO L226 Difference]: Without dead ends: 2380 [2025-03-08 06:30:06,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:06,945 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 7017 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7017 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:06,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7017 Valid, 4346 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-08 06:30:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-08 06:30:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4204322200392927) internal successors, (2169), 1555 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2169 transitions. [2025-03-08 06:30:06,959 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2169 transitions. Word has length 110 [2025-03-08 06:30:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2169 transitions. [2025-03-08 06:30:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2169 transitions. [2025-03-08 06:30:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:06,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:06,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:06,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:30:06,961 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -559632590, now seen corresponding path program 1 times [2025-03-08 06:30:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298379768] [2025-03-08 06:30:06,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:06,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:07,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:07,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298379768] [2025-03-08 06:30:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298379768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:07,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:07,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163268430] [2025-03-08 06:30:07,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:07,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:07,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:07,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:07,207 INFO L87 Difference]: Start difference. First operand 1556 states and 2169 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:08,620 INFO L93 Difference]: Finished difference Result 2565 states and 3592 transitions. [2025-03-08 06:30:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:08,622 INFO L225 Difference]: With dead ends: 2565 [2025-03-08 06:30:08,622 INFO L226 Difference]: Without dead ends: 2380 [2025-03-08 06:30:08,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:08,623 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 7014 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7014 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 3608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:08,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7014 Valid, 4346 Invalid, 3608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:30:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-08 06:30:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-08 06:30:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4197773411918795) internal successors, (2168), 1555 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2168 transitions. [2025-03-08 06:30:08,637 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2168 transitions. Word has length 110 [2025-03-08 06:30:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:08,637 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2168 transitions. [2025-03-08 06:30:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2168 transitions. [2025-03-08 06:30:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:08,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:08,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:30:08,639 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1473406524, now seen corresponding path program 1 times [2025-03-08 06:30:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991555418] [2025-03-08 06:30:08,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:08,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:08,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:08,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991555418] [2025-03-08 06:30:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991555418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240863918] [2025-03-08 06:30:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:08,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:08,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:08,798 INFO L87 Difference]: Start difference. First operand 1556 states and 2168 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:09,899 INFO L93 Difference]: Finished difference Result 2414 states and 3327 transitions. [2025-03-08 06:30:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:09,902 INFO L225 Difference]: With dead ends: 2414 [2025-03-08 06:30:09,902 INFO L226 Difference]: Without dead ends: 2243 [2025-03-08 06:30:09,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:09,904 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 7873 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7873 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:09,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7873 Valid, 3169 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-08 06:30:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-08 06:30:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4191224623444663) internal successors, (2167), 1555 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2167 transitions. [2025-03-08 06:30:09,918 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2167 transitions. Word has length 110 [2025-03-08 06:30:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:09,918 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2167 transitions. [2025-03-08 06:30:09,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2167 transitions. [2025-03-08 06:30:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:09,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:30:09,920 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:09,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 982337748, now seen corresponding path program 1 times [2025-03-08 06:30:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213431940] [2025-03-08 06:30:09,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:09,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:09,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:09,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:09,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:10,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213431940] [2025-03-08 06:30:10,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213431940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:10,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84424728] [2025-03-08 06:30:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:10,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:10,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:10,103 INFO L87 Difference]: Start difference. First operand 1556 states and 2167 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:11,426 INFO L93 Difference]: Finished difference Result 2619 states and 3671 transitions. [2025-03-08 06:30:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:11,428 INFO L225 Difference]: With dead ends: 2619 [2025-03-08 06:30:11,428 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:30:11,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:11,429 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 3111 mSDsluCounter, 3828 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:11,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3111 Valid, 4993 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:30:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:30:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.418467583497053) internal successors, (2166), 1555 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2166 transitions. [2025-03-08 06:30:11,442 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2166 transitions. Word has length 110 [2025-03-08 06:30:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:11,442 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2166 transitions. [2025-03-08 06:30:11,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2166 transitions. [2025-03-08 06:30:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:11,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:11,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:30:11,444 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1301663834, now seen corresponding path program 1 times [2025-03-08 06:30:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287580159] [2025-03-08 06:30:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287580159] [2025-03-08 06:30:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287580159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:11,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108925827] [2025-03-08 06:30:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:11,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:11,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:11,633 INFO L87 Difference]: Start difference. First operand 1556 states and 2166 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:12,755 INFO L93 Difference]: Finished difference Result 2411 states and 3321 transitions. [2025-03-08 06:30:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:12,758 INFO L225 Difference]: With dead ends: 2411 [2025-03-08 06:30:12,758 INFO L226 Difference]: Without dead ends: 2243 [2025-03-08 06:30:12,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:12,759 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 3989 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:12,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 3157 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-08 06:30:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1556. [2025-03-08 06:30:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4178127046496398) internal successors, (2165), 1555 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2165 transitions. [2025-03-08 06:30:12,773 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2165 transitions. Word has length 110 [2025-03-08 06:30:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:12,774 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2165 transitions. [2025-03-08 06:30:12,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2165 transitions. [2025-03-08 06:30:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:30:12,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:12,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:12,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:30:12,775 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:12,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1517002909, now seen corresponding path program 1 times [2025-03-08 06:30:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533542743] [2025-03-08 06:30:12,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:30:12,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:30:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:12,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533542743] [2025-03-08 06:30:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533542743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:12,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142101584] [2025-03-08 06:30:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:12,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:12,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:12,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:12,963 INFO L87 Difference]: Start difference. First operand 1556 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:14,074 INFO L93 Difference]: Finished difference Result 2506 states and 3484 transitions. [2025-03-08 06:30:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:14,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:30:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:14,077 INFO L225 Difference]: With dead ends: 2506 [2025-03-08 06:30:14,077 INFO L226 Difference]: Without dead ends: 2332 [2025-03-08 06:30:14,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:14,078 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 7529 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7529 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:14,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7529 Valid, 3712 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-03-08 06:30:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1556. [2025-03-08 06:30:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4171578258022266) internal successors, (2164), 1555 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2164 transitions. [2025-03-08 06:30:14,089 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2164 transitions. Word has length 110 [2025-03-08 06:30:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:14,089 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2164 transitions. [2025-03-08 06:30:14,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2164 transitions. [2025-03-08 06:30:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:30:14,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:14,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:14,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:30:14,091 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1672635950, now seen corresponding path program 1 times [2025-03-08 06:30:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067051014] [2025-03-08 06:30:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:30:14,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:30:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:14,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067051014] [2025-03-08 06:30:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067051014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558989876] [2025-03-08 06:30:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:14,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:14,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:14,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:14,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:14,314 INFO L87 Difference]: Start difference. First operand 1556 states and 2164 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:15,793 INFO L93 Difference]: Finished difference Result 2613 states and 3661 transitions. [2025-03-08 06:30:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:15,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:30:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:15,796 INFO L225 Difference]: With dead ends: 2613 [2025-03-08 06:30:15,796 INFO L226 Difference]: Without dead ends: 2404 [2025-03-08 06:30:15,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:15,797 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 5994 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 4728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5994 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:15,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5994 Valid, 5866 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4728 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:30:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-08 06:30:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1556. [2025-03-08 06:30:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4165029469548134) internal successors, (2163), 1555 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2163 transitions. [2025-03-08 06:30:15,809 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2163 transitions. Word has length 111 [2025-03-08 06:30:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:15,809 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2163 transitions. [2025-03-08 06:30:15,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2163 transitions. [2025-03-08 06:30:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:30:15,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:15,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:15,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:30:15,811 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1441478986, now seen corresponding path program 1 times [2025-03-08 06:30:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206211850] [2025-03-08 06:30:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:15,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:30:15,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:30:15,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:15,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206211850] [2025-03-08 06:30:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206211850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104348024] [2025-03-08 06:30:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:15,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:15,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:15,995 INFO L87 Difference]: Start difference. First operand 1556 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:17,296 INFO L93 Difference]: Finished difference Result 2564 states and 3583 transitions. [2025-03-08 06:30:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:30:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:17,298 INFO L225 Difference]: With dead ends: 2564 [2025-03-08 06:30:17,298 INFO L226 Difference]: Without dead ends: 2380 [2025-03-08 06:30:17,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:17,299 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 6591 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6591 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:17,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6591 Valid, 4626 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-08 06:30:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1556. [2025-03-08 06:30:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4158480681074002) internal successors, (2162), 1555 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2162 transitions. [2025-03-08 06:30:17,311 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2162 transitions. Word has length 111 [2025-03-08 06:30:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:17,311 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2162 transitions. [2025-03-08 06:30:17,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2162 transitions. [2025-03-08 06:30:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:17,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:17,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:30:17,313 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash -535694586, now seen corresponding path program 1 times [2025-03-08 06:30:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219825331] [2025-03-08 06:30:17,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:17,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219825331] [2025-03-08 06:30:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219825331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95650663] [2025-03-08 06:30:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:17,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:17,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:17,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:17,496 INFO L87 Difference]: Start difference. First operand 1556 states and 2162 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:18,596 INFO L93 Difference]: Finished difference Result 2522 states and 3499 transitions. [2025-03-08 06:30:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:18,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:18,598 INFO L225 Difference]: With dead ends: 2522 [2025-03-08 06:30:18,598 INFO L226 Difference]: Without dead ends: 2332 [2025-03-08 06:30:18,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:18,599 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 3640 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:18,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 3768 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-03-08 06:30:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1556. [2025-03-08 06:30:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1527 states have (on average 1.4145383104125737) internal successors, (2160), 1555 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2160 transitions. [2025-03-08 06:30:18,612 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2160 transitions. Word has length 112 [2025-03-08 06:30:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:18,612 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2160 transitions. [2025-03-08 06:30:18,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2160 transitions. [2025-03-08 06:30:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:18,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:18,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:30:18,613 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash 530100072, now seen corresponding path program 1 times [2025-03-08 06:30:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088038390] [2025-03-08 06:30:18,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:18,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:18,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:18,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:18,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088038390] [2025-03-08 06:30:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088038390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416319503] [2025-03-08 06:30:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:18,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:18,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:18,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:18,791 INFO L87 Difference]: Start difference. First operand 1556 states and 2160 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)