./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.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-var-start-time.4.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 92ab77284c41e8949aa8a67882902909eedb25047f32a3303bcd08767adce507 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:19:55,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:19:55,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:19:55,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:19:55,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:19:55,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:19:55,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:19:55,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:19:55,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:19:55,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:19:55,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:19:55,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:19:55,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:19:55,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:19:55,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:19:55,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:19:55,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:19:55,907 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 -> 92ab77284c41e8949aa8a67882902909eedb25047f32a3303bcd08767adce507 [2025-03-08 06:19:56,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:19:56,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:19:56,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:19:56,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:19:56,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:19:56,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:19:57,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b60f3a1/c6fe3ff2545c4c079489c5eefb2e0ec6/FLAG6fe18f5dc [2025-03-08 06:19:57,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:19:57,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:19:57,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b60f3a1/c6fe3ff2545c4c079489c5eefb2e0ec6/FLAG6fe18f5dc [2025-03-08 06:19:58,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b60f3a1/c6fe3ff2545c4c079489c5eefb2e0ec6 [2025-03-08 06:19:58,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:19:58,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:19:58,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:19:58,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:19:58,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:19:58,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:19:58" (1/1) ... [2025-03-08 06:19:58,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:19:58, skipping insertion in model container [2025-03-08 06:19:58,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:19:58" (1/1) ... [2025-03-08 06:19:58,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:19:59,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-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26799,26812] [2025-03-08 06:19:59,029 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33129,33142] [2025-03-08 06:19:59,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57661,57674] [2025-03-08 06:19:59,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65696,65709] [2025-03-08 06:19:59,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71499,71512] [2025-03-08 06:19:59,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82182,82195] [2025-03-08 06:19:59,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90107,90120] [2025-03-08 06:19:59,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97295,97308] [2025-03-08 06:19:59,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[131822,131835] [2025-03-08 06:19:59,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[134930,134943] [2025-03-08 06:19:59,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[142923,142936] [2025-03-08 06:19:59,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[148707,148720] [2025-03-08 06:19:59,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[171333,171346] [2025-03-08 06:19:59,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199069,199082] [2025-03-08 06:19:59,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[225502,225515] [2025-03-08 06:19:59,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[252663,252676] [2025-03-08 06:19:59,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[283670,283683] [2025-03-08 06:19:59,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:19:59,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:19:59,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26799,26812] [2025-03-08 06:19:59,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33129,33142] [2025-03-08 06:19:59,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57661,57674] [2025-03-08 06:19:59,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65696,65709] [2025-03-08 06:19:59,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71499,71512] [2025-03-08 06:19:59,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82182,82195] [2025-03-08 06:19:59,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90107,90120] [2025-03-08 06:19:59,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97295,97308] [2025-03-08 06:19:59,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[131822,131835] [2025-03-08 06:19:59,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[134930,134943] [2025-03-08 06:19:59,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[142923,142936] [2025-03-08 06:19:59,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-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[148707,148720] [2025-03-08 06:19:59,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[171333,171346] [2025-03-08 06:19:59,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199069,199082] [2025-03-08 06:19:59,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[225502,225515] [2025-03-08 06:19:59,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[252663,252676] [2025-03-08 06:19:59,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[283670,283683] [2025-03-08 06:20:00,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:20:00,087 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:20:00,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00 WrapperNode [2025-03-08 06:20:00,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:20:00,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:20:00,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:20:00,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:20:00,094 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:20:00" (1/1) ... [2025-03-08 06:20:00,160 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:20:00" (1/1) ... [2025-03-08 06:20:00,470 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17942 [2025-03-08 06:20:00,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:20:00,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:20:00,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:20:00,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:20:00,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,619 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:20:00,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:20:00,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:20:00,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:20:00,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:20:00,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (1/1) ... [2025-03-08 06:20:00,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:20:00,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:20:00,863 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:20:00,866 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:20:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:20:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:20:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:20:00,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:20:01,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:20:01,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:20:07,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14769: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:07,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18998: havoc main_~node4__m4~73#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~96#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~121#1; [2025-03-08 06:20:07,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11070: havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-08 06:20:07,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24283: havoc main_~node1__m1~128#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~155#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4203: havoc main_~check__tmp~23#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13719: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28518: havoc main_~node1____CPAchecker_TMP_1~30#1;havoc main_~node1__m1~160#1;havoc main_~__tmp_182~0#1, main_~assert__arg~181#1;havoc main_~check__tmp~187#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~159#1;havoc main_~__tmp_181~0#1, main_~assert__arg~180#1;havoc main_~check__tmp~186#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15834: havoc main_~node1__m1~79#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~101#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~78#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~100#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16365: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~105#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~81#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~104#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22708: havoc main_~node1____CPAchecker_TMP_1~21#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17952: havoc main_~node2__m2~83#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9499: havoc main_~node2__m2~42#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~59#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13728: havoc main_~node4__m4~48#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15844: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17962: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:07,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27476: havoc main_~node1__m1~152#1;havoc main_~__tmp_174~0#1, main_~assert__arg~173#1;havoc main_~check__tmp~179#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10036: havoc main_~node2__m2~46#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~63#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13738: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19552: havoc main_~node1__m1~100#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~125#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~99#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~124#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30652: havoc main_~node2__m2~133#1;havoc main_~node1____CPAchecker_TMP_1~34#1;havoc main_~node1__m1~176#1;havoc main_~__tmp_198~0#1, main_~assert__arg~197#1;havoc main_~check__tmp~203#1;havoc main_~node4__m4~119#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~132#1;havoc main_~node1__m1~175#1;havoc main_~__tmp_197~0#1, main_~assert__arg~196#1;havoc main_~check__tmp~202#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14797: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15326: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29603: havoc main_~node2____CPAchecker_TMP_0~10#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7406: havoc main_~node1__m1~32#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~44#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19562: havoc main_~node1____CPAchecker_TMP_0~14#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22734: havoc main_~node2__m2~105#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2655: havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12697: havoc main_~node3__m3~45#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~81#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15872: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22744: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26972: havoc main_~node1__m1~149#1;havoc main_~__tmp_171~0#1, main_~assert__arg~170#1;havoc main_~check__tmp~176#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~148#1;havoc main_~__tmp_170~0#1, main_~assert__arg~169#1;havoc main_~check__tmp~175#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10589: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~67#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~66#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17990: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18524: havoc main_~node1__m1~94#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~119#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~93#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~118#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15354: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22754: havoc main_~node3__m3~87#1; [2025-03-08 06:20:07,375 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25926: havoc main_~node4__m4~100#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3204: havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29631: havoc main_~node2____CPAchecker_TMP_1~13#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19590: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14307: havoc main_~node4__m4~51#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~92#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22764: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25936: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156: havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21712: havoc main_~node1__m1~113#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~139#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~112#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~138#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~check__tmp~7#1;havoc main_~node4__m4~6#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~6#1; [2025-03-08 06:20:07,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30699: havoc main_~node2____CPAchecker_TMP_0~11#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5859: havoc main_~node1__m1~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~35#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~34#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22773: havoc main_~node4__m4~89#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920: havoc main_~node4__m4~26#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~41#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24890: havoc main_~node3__m3~94#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~133#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~160#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16963: havoc main_~node1__m1~85#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~109#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~84#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~108#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21722: havoc main_~node1____CPAchecker_TMP_0~19#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19080: havoc main_~node4__m4~74#1; [2025-03-08 06:20:07,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~check__tmp~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:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23309: havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~121#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~148#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22783: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30183: havoc main_~node1__m1~172#1;havoc main_~__tmp_194~0#1, main_~assert__arg~193#1;havoc main_~check__tmp~199#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7986: havoc main_~node1__m1~35#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29129: havoc main_~node1__m1~165#1;havoc main_~__tmp_187~0#1, main_~assert__arg~186#1;havoc main_~check__tmp~192#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~164#1;havoc main_~__tmp_186~0#1, main_~assert__arg~185#1;havoc main_~check__tmp~191#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15389: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3762: havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19090: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20148: havoc main_~node1__m1~104#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~129#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~103#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~128#1; [2025-03-08 06:20:07,378 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7996: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21211: havoc main_~node4__m4~83#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~109#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~135#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26496: havoc main_~node1__m1~146#1;havoc main_~__tmp_168~0#1, main_~assert__arg~167#1;havoc main_~check__tmp~173#1;havoc main_~node4__m4~102#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~145#1;havoc main_~__tmp_167~0#1, main_~assert__arg~166#1;havoc main_~check__tmp~172#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30727: havoc main_~node2____CPAchecker_TMP_1~14#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12229: havoc main_~node1__m1~60#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~78#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27029: havoc main_~node1____CPAchecker_TMP_0~24#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20158: havoc main_~node1____CPAchecker_TMP_0~16#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25973: havoc main_~node1__m1~141#1;havoc main_~__tmp_163~0#1, main_~assert__arg~162#1;havoc main_~check__tmp~168#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29145: havoc main_~node1____CPAchecker_TMP_1~31#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134: 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~4#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8534: havoc main_~node2__m2~35#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~52#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21751: havoc main_~node1____CPAchecker_TMP_1~18#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18581: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26512: havoc main_~node1____CPAchecker_TMP_1~26#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7491: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9077: havoc main_~node2__m2~39#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~56#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22820: havoc main_~node1__m1~118#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~144#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25463: havoc main_~node1__m1~138#1;havoc main_~__tmp_160~0#1, main_~assert__arg~159#1;havoc main_~check__tmp~165#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~137#1;havoc main_~__tmp_159~0#1, main_~assert__arg~158#1;havoc main_~check__tmp~164#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8024: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~31#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~30#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24411: havoc main_~node3__m3~92#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~129#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~156#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5916: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27057: havoc main_~node1____CPAchecker_TMP_1~27#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29172: havoc main_~node2__m2~127#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20187: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-08 06:20:07,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28118: havoc main_~node1____CPAchecker_TMP_1~29#1;havoc main_~node1__m1~157#1;havoc main_~__tmp_179~0#1, main_~assert__arg~178#1;havoc main_~check__tmp~184#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~156#1;havoc main_~__tmp_178~0#1, main_~assert__arg~177#1;havoc main_~check__tmp~183#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17020: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13322: havoc main_~node3__m3~49#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~85#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18609: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22310: havoc main_~node1__m1~117#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~143#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~116#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~142#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23896: havoc main_~node1__m1~125#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~152#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26539: havoc main_~node2__m2~118#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29182: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9634: havoc main_~node2__m2~43#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~60#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22320: havoc main_~node1____CPAchecker_TMP_0~21#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18092: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3294: havoc main_~node4__m4~11#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21794: havoc main_~node2____CPAchecker_TMP_1~5#1;havoc main_~node2__m2~99#1; [2025-03-08 06:20:07,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11752: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~75#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~74#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20737: havoc main_~node1__m1~107#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~133#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~106#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~132#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17567: havoc main_~node1__m1~89#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~113#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~88#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~112#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10171: havoc main_~node2__m2~47#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~64#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12286: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5944: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15987: havoc main_~node4__m4~59#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22330: havoc main_~node2__m2~102#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3304: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13875: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~89#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~88#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17048: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:07,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28679: havoc main_~node1__m1~161#1;havoc main_~__tmp_183~0#1, main_~assert__arg~182#1;havoc main_~check__tmp~188#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15997: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29210: havoc main_~node2____CPAchecker_TMP_1~12#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4901: havoc main_~node4__m4~16#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21287: havoc main_~node4__m4~84#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20230: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~92#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7017: havoc main_~node4__m4~27#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18118: havoc main_~node3__m3~70#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25520: havoc main_~node1____CPAchecker_TMP_0~23#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21297: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6499: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~38#1; [2025-03-08 06:20:07,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23412: havoc main_~node4__m4~92#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12314: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18128: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26586: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25003: havoc main_~node1__m1~134#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~161#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18137: havoc main_~node4__m4~69#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23422: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12854: havoc main_~node3__m3~46#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29767: havoc main_~node4__m4~115#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11271: havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~71#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18147: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22377: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25548: havoc main_~node1____CPAchecker_TMP_1~24#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27662: havoc main_~node1__m1~154#1;havoc main_~__tmp_176~0#1, main_~assert__arg~175#1;havoc main_~check__tmp~181#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~153#1;havoc main_~__tmp_175~0#1, main_~assert__arg~174#1;havoc main_~check__tmp~180#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29777: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16565: havoc main_~node4__m4~62#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~82#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-08 06:20:07,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20794: havoc main_~node1____CPAchecker_TMP_0~17#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17624: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26614: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30319: havoc main_~node4__m4~117#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~131#1;havoc main_~node1__m1~173#1;havoc main_~__tmp_195~0#1, main_~assert__arg~194#1;havoc main_~check__tmp~200#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27678: havoc main_~node1____CPAchecker_TMP_1~28#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19228: havoc main_~node1__m1~98#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~123#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~97#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~122#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23459: havoc main_~node1__m1~122#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~149#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28218: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8663: havoc main_~node2__m2~36#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~53#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22405: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20822: havoc main_~node1____CPAchecker_TMP_1~16#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14480: havoc main_~node4__m4~52#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~72#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~93#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17652: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24524: havoc main_~node1__m1~130#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~157#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8143: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29814: havoc main_~node1__m1~169#1;havoc main_~__tmp_191~0#1, main_~assert__arg~190#1;havoc main_~check__tmp~196#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3392: havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9206: havoc main_~node2__m2~40#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~57#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27705: havoc main_~node2__m2~122#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28244: havoc main_~node3__m3~105#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30887: havoc main_~node1__m1~177#1;havoc main_~__tmp_199~0#1, main_~assert__arg~198#1;havoc main_~check__tmp~204#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15037: havoc main_~node1__m1~76#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~97#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~96#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8169: havoc main_~node3__m3~34#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3941: havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28254: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5004: havoc main_~node4__m4~17#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22446: havoc main_~node2__m2~103#1; [2025-03-08 06:20:07,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9763: havoc main_~node2__m2~44#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~61#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8179: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28263: havoc main_~node4__m4~109#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~24#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5014: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10300: havoc main_~node2__m2~48#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~65#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19285: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8188: havoc main_~node4__m4~32#1; [2025-03-08 06:20:07,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27216: havoc main_~node1__m1~150#1;havoc main_~__tmp_172~0#1, main_~assert__arg~171#1;havoc main_~check__tmp~177#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28273: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6079: havoc main_~node4__m4~22#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13479: havoc main_~node3__m3~50#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20350: havoc main_~node4__m4~79#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27752: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30395: havoc main_~node4__m4~118#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8198: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15070: havoc main_~node2__m2~72#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8731: havoc main_~node4__m4~33#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19830: havoc main_~node1__m1~102#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~127#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~101#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11374: havoc main_~node4__m4~41#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6089: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28815: havoc main_~node4__m4~111#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~162#1;havoc main_~__tmp_184~0#1, main_~assert__arg~183#1;havoc main_~check__tmp~189#1; [2025-03-08 06:20:07,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20360: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26175: havoc main_~node1____CPAchecker_TMP_1~25#1;havoc main_~node1__m1~143#1;havoc main_~__tmp_165~0#1, main_~assert__arg~164#1;havoc main_~check__tmp~170#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~99#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~142#1;havoc main_~__tmp_164~0#1, main_~assert__arg~163#1;havoc main_~check__tmp~169#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16134: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~103#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~80#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~102#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30405: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10850: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~69#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~68#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29352: havoc main_~node1__m1~166#1;havoc main_~__tmp_188~0#1, main_~assert__arg~187#1;havoc main_~check__tmp~193#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23011: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~146#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~119#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~145#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25125: havoc main_~node3__m3~95#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~135#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~162#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8741: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11384: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19313: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15618: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~99#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-08 06:20:07,387 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14562: havoc main_~node4__m4~53#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12449: havoc main_~node4__m4~46#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7164: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~42#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21435: havoc main_~node1__m1~111#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~137#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~110#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~136#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22493: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27780: havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28310: havoc main_~node1__m1~158#1;havoc main_~__tmp_180~0#1, main_~assert__arg~179#1;havoc main_~check__tmp~185#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14572: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12459: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9288: havoc main_~node4__m4~34#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21445: havoc main_~node1____CPAchecker_TMP_0~18#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1362: 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~5#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26732: havoc main_~node4__m4~103#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9825: havoc main_~node4__m4~35#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2427: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9298: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15112: havoc main_~node3__m3~59#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18283: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~117#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~92#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~116#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24099: havoc main_~node1____CPAchecker_TMP_1~23#1;havoc main_~node1__m1~127#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~154#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~126#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~153#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26742: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30442: havoc main_~node1__m1~174#1;havoc main_~__tmp_196~0#1, main_~assert__arg~195#1;havoc main_~check__tmp~201#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1906: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#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~8#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13005: havoc main_~node3__m3~47#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~83#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9835: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22521: havoc main_~node2____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18826: havoc main_~node4__m4~72#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~95#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~120#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-08 06:20:07,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19887: havoc main_~node1____CPAchecker_TMP_0~15#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21473: havoc main_~node1____CPAchecker_TMP_1~17#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24646: havoc main_~node3__m3~93#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~131#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~158#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10376: havoc main_~node2__m2~49#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8264: havoc main_~node2__m2~33#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5623: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~33#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~32#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25707: havoc main_~node1__m1~139#1;havoc main_~__tmp_161~0#1, main_~assert__arg~160#1;havoc main_~check__tmp~166#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4041: havoc main_~node3__m3~17#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: havoc main_~check__tmp~3#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~2#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10386: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7750: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:07,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8807: havoc main_~node2__m2~37#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~54#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4051: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26779: havoc main_~node1__m1~147#1;havoc main_~__tmp_169~0#1, main_~assert__arg~168#1;havoc main_~check__tmp~174#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16738: havoc main_~node4__m4~63#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~83#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~107#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10396: havoc main_~node3__m3~35#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15153: havoc main_~node4__m4~56#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28897: havoc main_~node4__m4~112#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22556: havoc main_~node1____CPAchecker_TMP_1~20#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19915: havoc main_~node1____CPAchecker_TMP_1~14#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4060: havoc main_~node4__m4~12#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25204: havoc main_~node3__m3~96#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10406: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:07,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14107: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~90#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11993: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28907: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22039: havoc main_~node1__m1~115#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~141#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~114#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~140#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4070: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10415: havoc main_~node4__m4~36#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25214: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17288: havoc main_~node1__m1~87#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~111#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~86#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~110#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6719: havoc main_~node4__m4~25#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~40#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9364: havoc main_~node2__m2~41#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~58#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22049: havoc main_~node1____CPAchecker_TMP_0~20#1; [2025-03-08 06:20:07,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25223: havoc main_~node4__m4~97#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10425: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12540: havoc main_~node3__m3~44#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~80#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17298: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~node2__m2~0#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9901: havoc main_~node2__m2~45#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~62#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13074: havoc main_~node4__m4~47#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25233: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5151: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~28#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23652: havoc main_~node1__m1~124#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~151#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~123#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~150#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27353: havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~151#1;havoc main_~__tmp_173~0#1, main_~assert__arg~172#1;havoc main_~check__tmp~178#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13084: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22599: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~104#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15200: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24715: havoc main_~node4__m4~96#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28944: havoc main_~node1__m1~163#1;havoc main_~__tmp_185~0#1, main_~assert__arg~184#1;havoc main_~check__tmp~190#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3577: havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node3__m3~0#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22077: havoc main_~node1____CPAchecker_TMP_1~19#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6222: havoc main_~check__tmp~37#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20496: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~131#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~105#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~130#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24725: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17326: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13630: havoc main_~node3__m3~51#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~87#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26316: havoc main_~node1__m1~144#1;havoc main_~__tmp_166~0#1, main_~assert__arg~165#1;havoc main_~check__tmp~171#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-08 06:20:07,392 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11521: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~73#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~72#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30022: havoc main_~node1____CPAchecker_TMP_1~33#1;havoc main_~node1__m1~171#1;havoc main_~__tmp_193~0#1, main_~assert__arg~192#1;havoc main_~check__tmp~198#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~130#1;havoc main_~node1__m1~170#1;havoc main_~__tmp_192~0#1, main_~assert__arg~191#1;havoc main_~check__tmp~197#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node4__m4~0#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21039: havoc main_~node4__m4~82#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~108#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1486: havoc main_~node4__m4~5#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25270: havoc main_~node1__m1~136#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~163#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15228: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16814: havoc main_~node4__m4~64#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27922: havoc main_~node1__m1~155#1;havoc main_~__tmp_177~0#1, main_~assert__arg~176#1;havoc main_~check__tmp~182#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1496: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:07,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23165: havoc main_~node1__m1~120#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~147#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16824: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14712: havoc main_~node1__m1~74#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~94#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2557: havoc main_~node4__m4~10#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17886: havoc main_~node1__m1~91#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~115#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~90#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~114#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24762: havoc main_~node1__m1~132#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~159#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31107: havoc main_~node2____CPAchecker_TMP_1~15#1;havoc main_~node2__m2~135#1;havoc main_~node1____CPAchecker_TMP_1~35#1;havoc main_~node1__m1~179#1;havoc main_~__tmp_201~0#1, main_~assert__arg~200#1;havoc main_~check__tmp~206#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~134#1;havoc main_~node1__m1~178#1;havoc main_~__tmp_200~0#1, main_~assert__arg~199#1;havoc main_~check__tmp~205#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24236: havoc main_~node4__m4~95#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23709: havoc main_~node1____CPAchecker_TMP_0~22#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17896: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24246: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-08 06:20:07,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15263: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8399: havoc main_~node2__m2~34#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~51#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc main_~node4__m4~15#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27429: havoc main_~node4__m4~106#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25844: havoc main_~node4__m4~99#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~140#1;havoc main_~__tmp_162~0#1, main_~assert__arg~161#1;havoc main_~check__tmp~167#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13165: havoc main_~node3__m3~48#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~65#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~84#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23737: havoc main_~node1____CPAchecker_TMP_1~22#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17925: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27439: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8942: havoc main_~node2__m2~38#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~55#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29556: havoc main_~node2__m2~129#1;havoc main_~node1____CPAchecker_TMP_1~32#1;havoc main_~node1__m1~168#1;havoc main_~__tmp_190~0#1, main_~assert__arg~189#1;havoc main_~check__tmp~195#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~167#1;havoc main_~__tmp_189~0#1, main_~assert__arg~188#1;havoc main_~check__tmp~194#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15291: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:07,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13709: havoc main_~node3__m3~52#1; [2025-03-08 06:20:07,909 INFO L? ?]: Removed 3204 outVars from TransFormulas that were not future-live. [2025-03-08 06:20:07,909 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:20:07,965 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:20:07,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:20:07,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:20:07 BoogieIcfgContainer [2025-03-08 06:20:07,969 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:20:07,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:20:07,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:20:07,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:20:07,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:19:58" (1/3) ... [2025-03-08 06:20:07,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:20:07, skipping insertion in model container [2025-03-08 06:20:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:00" (2/3) ... [2025-03-08 06:20:07,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:20:07, skipping insertion in model container [2025-03-08 06:20:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:20:07" (3/3) ... [2025-03-08 06:20:07,978 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:20:07,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:20:07,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 3532 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-08 06:20:08,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:20:08,112 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;@66c8fa38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:20:08,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-08 06:20:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 3532 states, 3514 states have (on average 1.8264086511098463) internal successors, (6418), 3531 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:20:08,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:08,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:08,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1683600738, now seen corresponding path program 1 times [2025-03-08 06:20:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071456310] [2025-03-08 06:20:08,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:08,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:20:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:20:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:08,680 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:20:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071456310] [2025-03-08 06:20:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071456310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:08,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:08,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524351519] [2025-03-08 06:20:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:08,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:08,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:08,714 INFO L87 Difference]: Start difference. First operand has 3532 states, 3514 states have (on average 1.8264086511098463) internal successors, (6418), 3531 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:11,342 INFO L93 Difference]: Finished difference Result 6037 states and 10781 transitions. [2025-03-08 06:20:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:11,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:20:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:11,372 INFO L225 Difference]: With dead ends: 6037 [2025-03-08 06:20:11,373 INFO L226 Difference]: Without dead ends: 3573 [2025-03-08 06:20:11,379 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:20:11,380 INFO L435 NwaCegarLoop]: 2776 mSDtfsCounter, 17440 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17440 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:11,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17440 Valid, 3535 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 06:20:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-08 06:20:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3553. [2025-03-08 06:20:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3536 states have (on average 1.3498303167420815) internal successors, (4773), 3552 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4773 transitions. [2025-03-08 06:20:11,526 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4773 transitions. Word has length 64 [2025-03-08 06:20:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 4773 transitions. [2025-03-08 06:20:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4773 transitions. [2025-03-08 06:20:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:20:11,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:11,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:20:11,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1746143536, now seen corresponding path program 1 times [2025-03-08 06:20:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:11,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633041698] [2025-03-08 06:20:11,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:11,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:20:11,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:20:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633041698] [2025-03-08 06:20:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633041698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546156170] [2025-03-08 06:20:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:11,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:11,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:11,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:11,774 INFO L87 Difference]: Start difference. First operand 3553 states and 4773 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:13,816 INFO L93 Difference]: Finished difference Result 6935 states and 9351 transitions. [2025-03-08 06:20:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:13,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:20:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:13,832 INFO L225 Difference]: With dead ends: 6935 [2025-03-08 06:20:13,832 INFO L226 Difference]: Without dead ends: 4769 [2025-03-08 06:20:13,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:20:13,835 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 12422 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12422 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:13,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12422 Valid, 2196 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:20:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-03-08 06:20:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4745. [2025-03-08 06:20:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4745 states, 4728 states have (on average 1.3517343485617597) internal successors, (6391), 4744 states have internal predecessors, (6391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 6391 transitions. [2025-03-08 06:20:13,917 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 6391 transitions. Word has length 64 [2025-03-08 06:20:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 4745 states and 6391 transitions. [2025-03-08 06:20:13,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 6391 transitions. [2025-03-08 06:20:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:20:13,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:13,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:20:13,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -149589741, now seen corresponding path program 1 times [2025-03-08 06:20:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906051271] [2025-03-08 06:20:13,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:13,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:13,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:20:13,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:20:13,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:13,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:14,098 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:20:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906051271] [2025-03-08 06:20:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906051271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712892728] [2025-03-08 06:20:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:14,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:14,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:14,100 INFO L87 Difference]: Start difference. First operand 4745 states and 6391 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:15,359 INFO L93 Difference]: Finished difference Result 9719 states and 13133 transitions. [2025-03-08 06:20:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 06:20:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:15,377 INFO L225 Difference]: With dead ends: 9719 [2025-03-08 06:20:15,377 INFO L226 Difference]: Without dead ends: 6620 [2025-03-08 06:20:15,382 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:20:15,383 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 10937 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10937 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:15,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10937 Valid, 2132 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:20:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2025-03-08 06:20:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6593. [2025-03-08 06:20:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6593 states, 6576 states have (on average 1.3585766423357664) internal successors, (8934), 6592 states have internal predecessors, (8934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 8934 transitions. [2025-03-08 06:20:15,495 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 8934 transitions. Word has length 65 [2025-03-08 06:20:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 6593 states and 8934 transitions. [2025-03-08 06:20:15,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 8934 transitions. [2025-03-08 06:20:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:20:15,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:15,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:20:15,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1553251035, now seen corresponding path program 1 times [2025-03-08 06:20:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356526580] [2025-03-08 06:20:15,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:15,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:20:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:20:15,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:15,958 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:20:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356526580] [2025-03-08 06:20:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356526580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:20:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696158209] [2025-03-08 06:20:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:20:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:20:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:20:15,959 INFO L87 Difference]: Start difference. First operand 6593 states and 8934 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:18,295 INFO L93 Difference]: Finished difference Result 8995 states and 12459 transitions. [2025-03-08 06:20:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:20:18,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:20:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:18,314 INFO L225 Difference]: With dead ends: 8995 [2025-03-08 06:20:18,314 INFO L226 Difference]: Without dead ends: 8228 [2025-03-08 06:20:18,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:20:18,317 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 10101 mSDsluCounter, 5029 mSDsCounter, 0 mSdLazyCounter, 6081 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10101 SdHoareTripleChecker+Valid, 6542 SdHoareTripleChecker+Invalid, 6101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:18,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10101 Valid, 6542 Invalid, 6101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6081 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 06:20:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2025-03-08 06:20:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 6520. [2025-03-08 06:20:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6503 states have (on average 1.3573735199138859) internal successors, (8827), 6519 states have internal predecessors, (8827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 8827 transitions. [2025-03-08 06:20:18,447 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 8827 transitions. Word has length 66 [2025-03-08 06:20:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 6520 states and 8827 transitions. [2025-03-08 06:20:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 8827 transitions. [2025-03-08 06:20:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:20:18,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:18,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:18,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:20:18,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1524288963, now seen corresponding path program 1 times [2025-03-08 06:20:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6532865] [2025-03-08 06:20:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:20:18,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:20:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:18,580 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:20:18,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:18,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6532865] [2025-03-08 06:20:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6532865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:18,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697712339] [2025-03-08 06:20:18,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:18,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:18,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:18,582 INFO L87 Difference]: Start difference. First operand 6520 states and 8827 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:19,611 INFO L93 Difference]: Finished difference Result 12738 states and 17431 transitions. [2025-03-08 06:20:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:20:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:19,630 INFO L225 Difference]: With dead ends: 12738 [2025-03-08 06:20:19,631 INFO L226 Difference]: Without dead ends: 8352 [2025-03-08 06:20:19,637 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:20:19,637 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 9338 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9338 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:19,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9338 Valid, 1841 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:20:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8352 states. [2025-03-08 06:20:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8352 to 8317. [2025-03-08 06:20:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8317 states, 8300 states have (on average 1.3737349397590362) internal successors, (11402), 8316 states have internal predecessors, (11402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 11402 transitions. [2025-03-08 06:20:19,734 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 11402 transitions. Word has length 66 [2025-03-08 06:20:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:19,734 INFO L471 AbstractCegarLoop]: Abstraction has 8317 states and 11402 transitions. [2025-03-08 06:20:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 11402 transitions. [2025-03-08 06:20:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:20:19,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:19,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:20:19,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 594487283, now seen corresponding path program 1 times [2025-03-08 06:20:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:19,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543297507] [2025-03-08 06:20:19,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:19,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:20:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:20:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543297507] [2025-03-08 06:20:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543297507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410970744] [2025-03-08 06:20:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:20,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:20,040 INFO L87 Difference]: Start difference. First operand 8317 states and 11402 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:22,666 INFO L93 Difference]: Finished difference Result 14195 states and 19819 transitions. [2025-03-08 06:20:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:20:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:22,695 INFO L225 Difference]: With dead ends: 14195 [2025-03-08 06:20:22,695 INFO L226 Difference]: Without dead ends: 12836 [2025-03-08 06:20:22,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:20:22,703 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 14879 mSDsluCounter, 4511 mSDsCounter, 0 mSdLazyCounter, 6599 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14879 SdHoareTripleChecker+Valid, 5872 SdHoareTripleChecker+Invalid, 6731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 6599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:22,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14879 Valid, 5872 Invalid, 6731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 6599 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 06:20:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12836 states. [2025-03-08 06:20:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12836 to 8260. [2025-03-08 06:20:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8260 states, 8243 states have (on average 1.3732864248453234) internal successors, (11320), 8259 states have internal predecessors, (11320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8260 states to 8260 states and 11320 transitions. [2025-03-08 06:20:22,825 INFO L78 Accepts]: Start accepts. Automaton has 8260 states and 11320 transitions. Word has length 66 [2025-03-08 06:20:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:22,825 INFO L471 AbstractCegarLoop]: Abstraction has 8260 states and 11320 transitions. [2025-03-08 06:20:22,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 8260 states and 11320 transitions. [2025-03-08 06:20:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:20:22,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:22,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:22,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:20:22,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1942931662, now seen corresponding path program 1 times [2025-03-08 06:20:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525571557] [2025-03-08 06:20:22,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:22,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:20:22,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:20:22,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:22,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:23,467 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:20:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525571557] [2025-03-08 06:20:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525571557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:23,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:23,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:20:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487504853] [2025-03-08 06:20:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:23,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:20:23,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:23,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:20:23,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:20:23,469 INFO L87 Difference]: Start difference. First operand 8260 states and 11320 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:24,686 INFO L93 Difference]: Finished difference Result 10284 states and 14267 transitions. [2025-03-08 06:20:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:24,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:20:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:24,702 INFO L225 Difference]: With dead ends: 10284 [2025-03-08 06:20:24,703 INFO L226 Difference]: Without dead ends: 10280 [2025-03-08 06:20:24,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:20:24,706 INFO L435 NwaCegarLoop]: 2387 mSDtfsCounter, 12641 mSDsluCounter, 11572 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12641 SdHoareTripleChecker+Valid, 13959 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:24,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12641 Valid, 13959 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:20:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10280 states. [2025-03-08 06:20:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10280 to 8256. [2025-03-08 06:20:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8256 states, 8240 states have (on average 1.3733009708737864) internal successors, (11316), 8255 states have internal predecessors, (11316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 11316 transitions. [2025-03-08 06:20:24,822 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 11316 transitions. Word has length 67 [2025-03-08 06:20:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:24,823 INFO L471 AbstractCegarLoop]: Abstraction has 8256 states and 11316 transitions. [2025-03-08 06:20:24,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 11316 transitions. [2025-03-08 06:20:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:20:24,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:24,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:20:24,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:24,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -527750684, now seen corresponding path program 1 times [2025-03-08 06:20:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995765127] [2025-03-08 06:20:24,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:24,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:20:24,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:20:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:25,111 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:20:25,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995765127] [2025-03-08 06:20:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995765127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:25,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811439267] [2025-03-08 06:20:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:25,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:25,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:25,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:25,112 INFO L87 Difference]: Start difference. First operand 8256 states and 11316 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:27,744 INFO L93 Difference]: Finished difference Result 11817 states and 16304 transitions. [2025-03-08 06:20:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:20:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:27,765 INFO L225 Difference]: With dead ends: 11817 [2025-03-08 06:20:27,765 INFO L226 Difference]: Without dead ends: 11809 [2025-03-08 06:20:27,771 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:20:27,772 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 11673 mSDsluCounter, 5620 mSDsCounter, 0 mSdLazyCounter, 6950 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11673 SdHoareTripleChecker+Valid, 7040 SdHoareTripleChecker+Invalid, 7008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 6950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:27,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11673 Valid, 7040 Invalid, 7008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6950 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 06:20:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2025-03-08 06:20:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 8256. [2025-03-08 06:20:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8256 states, 8240 states have (on average 1.3731796116504855) internal successors, (11315), 8255 states have internal predecessors, (11315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 11315 transitions. [2025-03-08 06:20:27,996 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 11315 transitions. Word has length 67 [2025-03-08 06:20:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:27,997 INFO L471 AbstractCegarLoop]: Abstraction has 8256 states and 11315 transitions. [2025-03-08 06:20:27,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 11315 transitions. [2025-03-08 06:20:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:20:28,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:28,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:28,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:20:28,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 921697053, now seen corresponding path program 1 times [2025-03-08 06:20:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304814621] [2025-03-08 06:20:28,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:28,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:20:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:20:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:28,330 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:20:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304814621] [2025-03-08 06:20:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304814621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605337218] [2025-03-08 06:20:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:28,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:28,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:28,332 INFO L87 Difference]: Start difference. First operand 8256 states and 11315 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:30,396 INFO L93 Difference]: Finished difference Result 9696 states and 13326 transitions. [2025-03-08 06:20:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:20:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:30,406 INFO L225 Difference]: With dead ends: 9696 [2025-03-08 06:20:30,407 INFO L226 Difference]: Without dead ends: 9691 [2025-03-08 06:20:30,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:20:30,412 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 13086 mSDsluCounter, 4408 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13086 SdHoareTripleChecker+Valid, 5780 SdHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:30,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13086 Valid, 5780 Invalid, 5198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5174 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:20:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2025-03-08 06:20:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 8256. [2025-03-08 06:20:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8256 states, 8240 states have (on average 1.3730582524271844) internal successors, (11314), 8255 states have internal predecessors, (11314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 11314 transitions. [2025-03-08 06:20:30,529 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 11314 transitions. Word has length 67 [2025-03-08 06:20:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 8256 states and 11314 transitions. [2025-03-08 06:20:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 11314 transitions. [2025-03-08 06:20:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:20:30,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:30,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:20:30,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1753741310, now seen corresponding path program 1 times [2025-03-08 06:20:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246374411] [2025-03-08 06:20:30,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:30,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:20:30,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:20:30,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:30,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:30,955 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:20:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246374411] [2025-03-08 06:20:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246374411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:30,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:30,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:20:30,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342453725] [2025-03-08 06:20:30,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:30,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:20:30,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:30,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:20:30,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:20:30,956 INFO L87 Difference]: Start difference. First operand 8256 states and 11314 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:32,093 INFO L93 Difference]: Finished difference Result 11842 states and 16600 transitions. [2025-03-08 06:20:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 06:20:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:20:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:32,106 INFO L225 Difference]: With dead ends: 11842 [2025-03-08 06:20:32,106 INFO L226 Difference]: Without dead ends: 10480 [2025-03-08 06:20:32,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:20:32,111 INFO L435 NwaCegarLoop]: 2233 mSDtfsCounter, 13118 mSDsluCounter, 7583 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13118 SdHoareTripleChecker+Valid, 9816 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:32,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13118 Valid, 9816 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:20:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10480 states. [2025-03-08 06:20:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10480 to 8192. [2025-03-08 06:20:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 8177 states have (on average 1.37287513758102) internal successors, (11226), 8191 states have internal predecessors, (11226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 11226 transitions. [2025-03-08 06:20:32,237 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 11226 transitions. Word has length 67 [2025-03-08 06:20:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:32,237 INFO L471 AbstractCegarLoop]: Abstraction has 8192 states and 11226 transitions. [2025-03-08 06:20:32,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 11226 transitions. [2025-03-08 06:20:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:32,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:32,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:32,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:20:32,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1664414035, now seen corresponding path program 1 times [2025-03-08 06:20:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408606106] [2025-03-08 06:20:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:32,748 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:20:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408606106] [2025-03-08 06:20:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408606106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:32,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:32,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:20:32,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700200925] [2025-03-08 06:20:32,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:32,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:20:32,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:32,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:20:32,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:20:32,750 INFO L87 Difference]: Start difference. First operand 8192 states and 11226 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:36,157 INFO L93 Difference]: Finished difference Result 18945 states and 26735 transitions. [2025-03-08 06:20:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 06:20:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:36,178 INFO L225 Difference]: With dead ends: 18945 [2025-03-08 06:20:36,178 INFO L226 Difference]: Without dead ends: 18934 [2025-03-08 06:20:36,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:20:36,184 INFO L435 NwaCegarLoop]: 2254 mSDtfsCounter, 15623 mSDsluCounter, 17054 mSDsCounter, 0 mSdLazyCounter, 5554 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15623 SdHoareTripleChecker+Valid, 19308 SdHoareTripleChecker+Invalid, 5674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 5554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:36,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15623 Valid, 19308 Invalid, 5674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 5554 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 06:20:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2025-03-08 06:20:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 8186. [2025-03-08 06:20:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8186 states, 8171 states have (on average 1.3730265573369234) internal successors, (11219), 8185 states have internal predecessors, (11219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 11219 transitions. [2025-03-08 06:20:36,326 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 11219 transitions. Word has length 68 [2025-03-08 06:20:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 8186 states and 11219 transitions. [2025-03-08 06:20:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 11219 transitions. [2025-03-08 06:20:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:36,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:36,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:20:36,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1709809074, now seen corresponding path program 1 times [2025-03-08 06:20:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623647732] [2025-03-08 06:20:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:36,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:36,601 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:20:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623647732] [2025-03-08 06:20:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623647732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:20:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215794815] [2025-03-08 06:20:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:36,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:20:36,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:36,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:20:36,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:20:36,603 INFO L87 Difference]: Start difference. First operand 8186 states and 11219 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:38,676 INFO L93 Difference]: Finished difference Result 11405 states and 15877 transitions. [2025-03-08 06:20:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:20:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:38,686 INFO L225 Difference]: With dead ends: 11405 [2025-03-08 06:20:38,686 INFO L226 Difference]: Without dead ends: 9824 [2025-03-08 06:20:38,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:20:38,690 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 10932 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 5100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10932 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:38,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10932 Valid, 5726 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5100 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:20:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9824 states. [2025-03-08 06:20:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9824 to 8186. [2025-03-08 06:20:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8186 states, 8171 states have (on average 1.3729041732958023) internal successors, (11218), 8185 states have internal predecessors, (11218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 11218 transitions. [2025-03-08 06:20:38,774 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 11218 transitions. Word has length 68 [2025-03-08 06:20:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:38,774 INFO L471 AbstractCegarLoop]: Abstraction has 8186 states and 11218 transitions. [2025-03-08 06:20:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 11218 transitions. [2025-03-08 06:20:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:38,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:38,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:20:38,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1265022055, now seen corresponding path program 1 times [2025-03-08 06:20:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074706092] [2025-03-08 06:20:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:38,949 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:20:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074706092] [2025-03-08 06:20:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074706092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320503492] [2025-03-08 06:20:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:38,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:38,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:38,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:38,951 INFO L87 Difference]: Start difference. First operand 8186 states and 11218 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:41,483 INFO L93 Difference]: Finished difference Result 14115 states and 19707 transitions. [2025-03-08 06:20:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:41,497 INFO L225 Difference]: With dead ends: 14115 [2025-03-08 06:20:41,498 INFO L226 Difference]: Without dead ends: 12756 [2025-03-08 06:20:41,501 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:20:41,502 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 14107 mSDsluCounter, 4687 mSDsCounter, 0 mSdLazyCounter, 6709 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14107 SdHoareTripleChecker+Valid, 6111 SdHoareTripleChecker+Invalid, 6835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:41,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14107 Valid, 6111 Invalid, 6835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6709 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 06:20:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12756 states. [2025-03-08 06:20:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12756 to 8186. [2025-03-08 06:20:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8186 states, 8171 states have (on average 1.3727817892546812) internal successors, (11217), 8185 states have internal predecessors, (11217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 11217 transitions. [2025-03-08 06:20:41,603 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 11217 transitions. Word has length 68 [2025-03-08 06:20:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:41,604 INFO L471 AbstractCegarLoop]: Abstraction has 8186 states and 11217 transitions. [2025-03-08 06:20:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 11217 transitions. [2025-03-08 06:20:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:41,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:41,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:41,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:20:41,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:41,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1446008360, now seen corresponding path program 1 times [2025-03-08 06:20:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582616629] [2025-03-08 06:20:41,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:41,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:41,777 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:20:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582616629] [2025-03-08 06:20:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582616629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989619671] [2025-03-08 06:20:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:41,779 INFO L87 Difference]: Start difference. First operand 8186 states and 11217 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:44,304 INFO L93 Difference]: Finished difference Result 14448 states and 20353 transitions. [2025-03-08 06:20:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:20:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:44,316 INFO L225 Difference]: With dead ends: 14448 [2025-03-08 06:20:44,317 INFO L226 Difference]: Without dead ends: 13131 [2025-03-08 06:20:44,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:20:44,320 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 9195 mSDsluCounter, 5706 mSDsCounter, 0 mSdLazyCounter, 6940 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9195 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 7008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 6940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:44,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9195 Valid, 7127 Invalid, 7008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 6940 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 06:20:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13131 states. [2025-03-08 06:20:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13131 to 8186. [2025-03-08 06:20:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8186 states, 8171 states have (on average 1.3726594052135601) internal successors, (11216), 8185 states have internal predecessors, (11216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 11216 transitions. [2025-03-08 06:20:44,435 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 11216 transitions. Word has length 68 [2025-03-08 06:20:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:44,435 INFO L471 AbstractCegarLoop]: Abstraction has 8186 states and 11216 transitions. [2025-03-08 06:20:44,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 11216 transitions. [2025-03-08 06:20:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:44,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:44,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:44,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:20:44,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1807945282, now seen corresponding path program 1 times [2025-03-08 06:20:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192540518] [2025-03-08 06:20:44,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:44,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:44,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:44,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:44,781 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:20:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192540518] [2025-03-08 06:20:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192540518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:20:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482676757] [2025-03-08 06:20:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:44,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:20:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:44,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:20:44,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:20:44,783 INFO L87 Difference]: Start difference. First operand 8186 states and 11216 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:46,087 INFO L93 Difference]: Finished difference Result 12133 states and 16942 transitions. [2025-03-08 06:20:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:46,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:46,101 INFO L225 Difference]: With dead ends: 12133 [2025-03-08 06:20:46,101 INFO L226 Difference]: Without dead ends: 12125 [2025-03-08 06:20:46,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:20:46,106 INFO L435 NwaCegarLoop]: 2484 mSDtfsCounter, 14919 mSDsluCounter, 13121 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14919 SdHoareTripleChecker+Valid, 15605 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:46,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14919 Valid, 15605 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:20:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12125 states. [2025-03-08 06:20:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12125 to 8178. [2025-03-08 06:20:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8164 states have (on average 1.372733953944145) internal successors, (11207), 8177 states have internal predecessors, (11207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 11207 transitions. [2025-03-08 06:20:46,254 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 11207 transitions. Word has length 68 [2025-03-08 06:20:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 11207 transitions. [2025-03-08 06:20:46,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 11207 transitions. [2025-03-08 06:20:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:20:46,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:46,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:46,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:20:46,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:46,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1031126213, now seen corresponding path program 1 times [2025-03-08 06:20:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:46,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575062692] [2025-03-08 06:20:46,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:46,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:20:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:20:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:46,316 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:20:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575062692] [2025-03-08 06:20:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575062692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594453716] [2025-03-08 06:20:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:46,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,317 INFO L87 Difference]: Start difference. First operand 8178 states and 11207 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:46,436 INFO L93 Difference]: Finished difference Result 12036 states and 16773 transitions. [2025-03-08 06:20:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 06:20:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:46,444 INFO L225 Difference]: With dead ends: 12036 [2025-03-08 06:20:46,444 INFO L226 Difference]: Without dead ends: 7361 [2025-03-08 06:20:46,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,451 INFO L435 NwaCegarLoop]: 1980 mSDtfsCounter, 1931 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:46,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 2652 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2025-03-08 06:20:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 7343. [2025-03-08 06:20:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7343 states, 7333 states have (on average 1.3876994408836765) internal successors, (10176), 7342 states have internal predecessors, (10176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 10176 transitions. [2025-03-08 06:20:46,521 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 10176 transitions. Word has length 68 [2025-03-08 06:20:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:46,521 INFO L471 AbstractCegarLoop]: Abstraction has 7343 states and 10176 transitions. [2025-03-08 06:20:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 10176 transitions. [2025-03-08 06:20:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:20:46,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:46,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:46,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:20:46,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:46,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash -736185921, now seen corresponding path program 1 times [2025-03-08 06:20:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309836575] [2025-03-08 06:20:46,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:46,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:20:46,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:20:46,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:46,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:46,578 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:20:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309836575] [2025-03-08 06:20:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309836575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188853810] [2025-03-08 06:20:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:46,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:46,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,581 INFO L87 Difference]: Start difference. First operand 7343 states and 10176 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:46,691 INFO L93 Difference]: Finished difference Result 11801 states and 16638 transitions. [2025-03-08 06:20:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:20:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:46,698 INFO L225 Difference]: With dead ends: 11801 [2025-03-08 06:20:46,698 INFO L226 Difference]: Without dead ends: 7015 [2025-03-08 06:20:46,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,703 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 1552 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:46,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2054 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7015 states. [2025-03-08 06:20:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7015 to 7007. [2025-03-08 06:20:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7007 states, 7000 states have (on average 1.4047142857142858) internal successors, (9833), 7006 states have internal predecessors, (9833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 9833 transitions. [2025-03-08 06:20:46,758 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 9833 transitions. Word has length 69 [2025-03-08 06:20:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:46,758 INFO L471 AbstractCegarLoop]: Abstraction has 7007 states and 9833 transitions. [2025-03-08 06:20:46,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 9833 transitions. [2025-03-08 06:20:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:20:46,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:46,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:46,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:20:46,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:46,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2071787563, now seen corresponding path program 1 times [2025-03-08 06:20:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615185026] [2025-03-08 06:20:46,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:46,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:20:46,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:20:46,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:46,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:46,811 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:20:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615185026] [2025-03-08 06:20:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615185026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:46,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644648699] [2025-03-08 06:20:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:46,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:46,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:46,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:46,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,813 INFO L87 Difference]: Start difference. First operand 7007 states and 9833 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:46,913 INFO L93 Difference]: Finished difference Result 14367 states and 20685 transitions. [2025-03-08 06:20:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:20:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:46,924 INFO L225 Difference]: With dead ends: 14367 [2025-03-08 06:20:46,924 INFO L226 Difference]: Without dead ends: 10139 [2025-03-08 06:20:46,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:46,929 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 887 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:46,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 3054 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10139 states. [2025-03-08 06:20:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10139 to 10131. [2025-03-08 06:20:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10131 states, 10124 states have (on average 1.4093243777163176) internal successors, (14268), 10130 states have internal predecessors, (14268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10131 states to 10131 states and 14268 transitions. [2025-03-08 06:20:47,023 INFO L78 Accepts]: Start accepts. Automaton has 10131 states and 14268 transitions. Word has length 69 [2025-03-08 06:20:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:47,023 INFO L471 AbstractCegarLoop]: Abstraction has 10131 states and 14268 transitions. [2025-03-08 06:20:47,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10131 states and 14268 transitions. [2025-03-08 06:20:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:20:47,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:47,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:47,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:20:47,028 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1024659053, now seen corresponding path program 1 times [2025-03-08 06:20:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954286896] [2025-03-08 06:20:47,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:20:47,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:20:47,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:47,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:47,093 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:20:47,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:47,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954286896] [2025-03-08 06:20:47,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954286896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:47,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847283262] [2025-03-08 06:20:47,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:47,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:47,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:47,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:47,095 INFO L87 Difference]: Start difference. First operand 10131 states and 14268 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:47,201 INFO L93 Difference]: Finished difference Result 22440 states and 32423 transitions. [2025-03-08 06:20:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:20:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:47,221 INFO L225 Difference]: With dead ends: 22440 [2025-03-08 06:20:47,221 INFO L226 Difference]: Without dead ends: 16169 [2025-03-08 06:20:47,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:47,231 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 1029 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:47,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 2971 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16169 states. [2025-03-08 06:20:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16169 to 16161. [2025-03-08 06:20:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16161 states, 16154 states have (on average 1.4181626841649126) internal successors, (22909), 16160 states have internal predecessors, (22909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16161 states to 16161 states and 22909 transitions. [2025-03-08 06:20:47,403 INFO L78 Accepts]: Start accepts. Automaton has 16161 states and 22909 transitions. Word has length 69 [2025-03-08 06:20:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:47,403 INFO L471 AbstractCegarLoop]: Abstraction has 16161 states and 22909 transitions. [2025-03-08 06:20:47,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16161 states and 22909 transitions. [2025-03-08 06:20:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:20:47,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:47,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:20:47,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash 714340209, now seen corresponding path program 1 times [2025-03-08 06:20:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034385350] [2025-03-08 06:20:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:47,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:20:47,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:20:47,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:47,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:47,488 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:20:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034385350] [2025-03-08 06:20:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034385350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014257309] [2025-03-08 06:20:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:47,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:47,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:47,489 INFO L87 Difference]: Start difference. First operand 16161 states and 22909 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:47,568 INFO L93 Difference]: Finished difference Result 31163 states and 45730 transitions. [2025-03-08 06:20:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:20:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:47,590 INFO L225 Difference]: With dead ends: 31163 [2025-03-08 06:20:47,590 INFO L226 Difference]: Without dead ends: 20581 [2025-03-08 06:20:47,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:47,605 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 946 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:47,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2361 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20581 states. [2025-03-08 06:20:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20581 to 16622. [2025-03-08 06:20:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16622 states, 16615 states have (on average 1.4375564249172434) internal successors, (23885), 16621 states have internal predecessors, (23885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16622 states to 16622 states and 23885 transitions. [2025-03-08 06:20:47,786 INFO L78 Accepts]: Start accepts. Automaton has 16622 states and 23885 transitions. Word has length 69 [2025-03-08 06:20:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:47,786 INFO L471 AbstractCegarLoop]: Abstraction has 16622 states and 23885 transitions. [2025-03-08 06:20:47,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16622 states and 23885 transitions. [2025-03-08 06:20:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:20:47,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:47,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:47,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:20:47,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:47,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash -961374250, now seen corresponding path program 1 times [2025-03-08 06:20:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414032105] [2025-03-08 06:20:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:20:47,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:20:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:47,838 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:20:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414032105] [2025-03-08 06:20:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414032105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345175845] [2025-03-08 06:20:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:47,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:47,839 INFO L87 Difference]: Start difference. First operand 16622 states and 23885 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:48,008 INFO L93 Difference]: Finished difference Result 33128 states and 48244 transitions. [2025-03-08 06:20:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:48,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 06:20:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:48,029 INFO L225 Difference]: With dead ends: 33128 [2025-03-08 06:20:48,029 INFO L226 Difference]: Without dead ends: 18147 [2025-03-08 06:20:48,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:48,044 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 1233 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:48,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 2047 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18147 states. [2025-03-08 06:20:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18147 to 14552. [2025-03-08 06:20:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14552 states, 14545 states have (on average 1.453970436576143) internal successors, (21148), 14551 states have internal predecessors, (21148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14552 states to 14552 states and 21148 transitions. [2025-03-08 06:20:48,207 INFO L78 Accepts]: Start accepts. Automaton has 14552 states and 21148 transitions. Word has length 70 [2025-03-08 06:20:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 14552 states and 21148 transitions. [2025-03-08 06:20:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14552 states and 21148 transitions. [2025-03-08 06:20:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:20:48,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:48,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:48,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:20:48,210 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:48,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash -988507150, now seen corresponding path program 1 times [2025-03-08 06:20:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471420722] [2025-03-08 06:20:48,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:48,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:20:48,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:20:48,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:48,258 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:20:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471420722] [2025-03-08 06:20:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471420722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594653939] [2025-03-08 06:20:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:48,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:48,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:48,260 INFO L87 Difference]: Start difference. First operand 14552 states and 21148 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:48,376 INFO L93 Difference]: Finished difference Result 29979 states and 44137 transitions. [2025-03-08 06:20:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 06:20:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:48,394 INFO L225 Difference]: With dead ends: 29979 [2025-03-08 06:20:48,394 INFO L226 Difference]: Without dead ends: 16546 [2025-03-08 06:20:48,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:48,407 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1306 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:48,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1858 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2025-03-08 06:20:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 13273. [2025-03-08 06:20:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13273 states, 13266 states have (on average 1.4693954470073873) internal successors, (19493), 13272 states have internal predecessors, (19493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 19493 transitions. [2025-03-08 06:20:48,536 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 19493 transitions. Word has length 70 [2025-03-08 06:20:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 13273 states and 19493 transitions. [2025-03-08 06:20:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 19493 transitions. [2025-03-08 06:20:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:48,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:48,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:48,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:20:48,565 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash -313586770, now seen corresponding path program 1 times [2025-03-08 06:20:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323433708] [2025-03-08 06:20:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:48,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:48,855 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:20:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323433708] [2025-03-08 06:20:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323433708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:20:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546818958] [2025-03-08 06:20:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:48,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:20:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:48,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:20:48,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:20:48,856 INFO L87 Difference]: Start difference. First operand 13273 states and 19493 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:50,443 INFO L93 Difference]: Finished difference Result 39171 states and 57407 transitions. [2025-03-08 06:20:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 06:20:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:50,489 INFO L225 Difference]: With dead ends: 39171 [2025-03-08 06:20:50,489 INFO L226 Difference]: Without dead ends: 38970 [2025-03-08 06:20:50,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:20:50,506 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 10939 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10939 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10939 Valid, 3068 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:20:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38970 states. [2025-03-08 06:20:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38970 to 13277. [2025-03-08 06:20:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.4692539562923888) internal successors, (19497), 13276 states have internal predecessors, (19497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19497 transitions. [2025-03-08 06:20:50,845 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19497 transitions. Word has length 71 [2025-03-08 06:20:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:50,845 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19497 transitions. [2025-03-08 06:20:50,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19497 transitions. [2025-03-08 06:20:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:50,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:50,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:50,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:20:50,848 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 276301186, now seen corresponding path program 1 times [2025-03-08 06:20:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285389385] [2025-03-08 06:20:50,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:50,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:50,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:50,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:51,086 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:20:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285389385] [2025-03-08 06:20:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285389385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639149685] [2025-03-08 06:20:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:51,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:51,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:51,087 INFO L87 Difference]: Start difference. First operand 13277 states and 19497 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:52,312 INFO L93 Difference]: Finished difference Result 31501 states and 46559 transitions. [2025-03-08 06:20:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:20:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:52,348 INFO L225 Difference]: With dead ends: 31501 [2025-03-08 06:20:52,349 INFO L226 Difference]: Without dead ends: 31281 [2025-03-08 06:20:52,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:20:52,361 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 6084 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6084 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:52,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6084 Valid, 3358 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2994 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:20:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31281 states. [2025-03-08 06:20:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31281 to 13277. [2025-03-08 06:20:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.469178598342125) internal successors, (19496), 13276 states have internal predecessors, (19496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19496 transitions. [2025-03-08 06:20:52,578 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19496 transitions. Word has length 71 [2025-03-08 06:20:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19496 transitions. [2025-03-08 06:20:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19496 transitions. [2025-03-08 06:20:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:52,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:52,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:52,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:20:52,580 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash -923233080, now seen corresponding path program 1 times [2025-03-08 06:20:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863503130] [2025-03-08 06:20:52,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:52,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:52,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:52,760 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:20:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863503130] [2025-03-08 06:20:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863503130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:52,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627226750] [2025-03-08 06:20:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:52,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:52,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:52,761 INFO L87 Difference]: Start difference. First operand 13277 states and 19496 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:53,844 INFO L93 Difference]: Finished difference Result 17017 states and 24831 transitions. [2025-03-08 06:20:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:53,860 INFO L225 Difference]: With dead ends: 17017 [2025-03-08 06:20:53,860 INFO L226 Difference]: Without dead ends: 16816 [2025-03-08 06:20:53,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:20:53,865 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 6987 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6987 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:53,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6987 Valid, 3270 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:20:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16816 states. [2025-03-08 06:20:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16816 to 13277. [2025-03-08 06:20:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.4691032403918614) internal successors, (19495), 13276 states have internal predecessors, (19495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19495 transitions. [2025-03-08 06:20:54,001 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19495 transitions. Word has length 71 [2025-03-08 06:20:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19495 transitions. [2025-03-08 06:20:54,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19495 transitions. [2025-03-08 06:20:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:54,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:54,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:54,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:20:54,003 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:54,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:54,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1018601212, now seen corresponding path program 1 times [2025-03-08 06:20:54,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:54,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639324810] [2025-03-08 06:20:54,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:54,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:54,162 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:20:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639324810] [2025-03-08 06:20:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639324810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:54,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:54,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979175848] [2025-03-08 06:20:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:54,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:54,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:54,164 INFO L87 Difference]: Start difference. First operand 13277 states and 19495 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:55,344 INFO L93 Difference]: Finished difference Result 19799 states and 28998 transitions. [2025-03-08 06:20:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:55,366 INFO L225 Difference]: With dead ends: 19799 [2025-03-08 06:20:55,366 INFO L226 Difference]: Without dead ends: 19579 [2025-03-08 06:20:55,372 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:20:55,373 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 5967 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5967 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:55,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5967 Valid, 3745 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:20:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19579 states. [2025-03-08 06:20:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19579 to 13277. [2025-03-08 06:20:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.4690278824415977) internal successors, (19494), 13276 states have internal predecessors, (19494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19494 transitions. [2025-03-08 06:20:55,525 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19494 transitions. Word has length 71 [2025-03-08 06:20:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:55,525 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19494 transitions. [2025-03-08 06:20:55,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19494 transitions. [2025-03-08 06:20:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:55,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:55,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:55,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:20:55,527 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:55,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1782008244, now seen corresponding path program 1 times [2025-03-08 06:20:55,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:55,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068060171] [2025-03-08 06:20:55,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:55,687 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:20:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068060171] [2025-03-08 06:20:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068060171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586659510] [2025-03-08 06:20:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:55,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:55,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:55,689 INFO L87 Difference]: Start difference. First operand 13277 states and 19494 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:56,738 INFO L93 Difference]: Finished difference Result 17017 states and 24829 transitions. [2025-03-08 06:20:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:20:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:56,758 INFO L225 Difference]: With dead ends: 17017 [2025-03-08 06:20:56,758 INFO L226 Difference]: Without dead ends: 16816 [2025-03-08 06:20:56,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:20:56,766 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 6920 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6920 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:56,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6920 Valid, 3322 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:20:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16816 states. [2025-03-08 06:20:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16816 to 13277. [2025-03-08 06:20:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.4689525244913337) internal successors, (19493), 13276 states have internal predecessors, (19493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19493 transitions. [2025-03-08 06:20:56,925 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19493 transitions. Word has length 71 [2025-03-08 06:20:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:56,925 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19493 transitions. [2025-03-08 06:20:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19493 transitions. [2025-03-08 06:20:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:20:56,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:56,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:56,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:20:56,928 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1904682036, now seen corresponding path program 1 times [2025-03-08 06:20:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225641678] [2025-03-08 06:20:56,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:56,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:20:56,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:20:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:57,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:20:57,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225641678] [2025-03-08 06:20:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225641678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:57,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:57,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:57,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565260863] [2025-03-08 06:20:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:57,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:57,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:57,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:57,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:57,104 INFO L87 Difference]: Start difference. First operand 13277 states and 19493 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:58,488 INFO L93 Difference]: Finished difference Result 22169 states and 32308 transitions. [2025-03-08 06:20:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:20:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:20:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:58,515 INFO L225 Difference]: With dead ends: 22169 [2025-03-08 06:20:58,515 INFO L226 Difference]: Without dead ends: 21899 [2025-03-08 06:20:58,523 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:20:58,524 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 3369 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3369 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:58,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3369 Valid, 3676 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:20:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2025-03-08 06:20:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 13277. [2025-03-08 06:20:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13277 states, 13270 states have (on average 1.46887716654107) internal successors, (19492), 13276 states have internal predecessors, (19492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13277 states to 13277 states and 19492 transitions. [2025-03-08 06:20:58,704 INFO L78 Accepts]: Start accepts. Automaton has 13277 states and 19492 transitions. Word has length 71 [2025-03-08 06:20:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:58,705 INFO L471 AbstractCegarLoop]: Abstraction has 13277 states and 19492 transitions. [2025-03-08 06:20:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 13277 states and 19492 transitions. [2025-03-08 06:20:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:20:58,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:58,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:58,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:20:58,707 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1405477795, now seen corresponding path program 1 times [2025-03-08 06:20:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752435628] [2025-03-08 06:20:58,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:20:58,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:20:58,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:58,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:58,761 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:20:58,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752435628] [2025-03-08 06:20:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752435628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:58,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:58,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414232288] [2025-03-08 06:20:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:58,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:58,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:58,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,763 INFO L87 Difference]: Start difference. First operand 13277 states and 19492 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:58,853 INFO L93 Difference]: Finished difference Result 30983 states and 46185 transitions. [2025-03-08 06:20:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:58,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 06:20:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:58,922 INFO L225 Difference]: With dead ends: 30983 [2025-03-08 06:20:58,922 INFO L226 Difference]: Without dead ends: 19300 [2025-03-08 06:20:58,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,925 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 832 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:58,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1958 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19300 states. [2025-03-08 06:20:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19300 to 15545. [2025-03-08 06:20:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15545 states, 15538 states have (on average 1.464409833955464) internal successors, (22754), 15544 states have internal predecessors, (22754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15545 states to 15545 states and 22754 transitions. [2025-03-08 06:20:59,046 INFO L78 Accepts]: Start accepts. Automaton has 15545 states and 22754 transitions. Word has length 72 [2025-03-08 06:20:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:59,046 INFO L471 AbstractCegarLoop]: Abstraction has 15545 states and 22754 transitions. [2025-03-08 06:20:59,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 15545 states and 22754 transitions. [2025-03-08 06:20:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:20:59,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:59,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:59,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:20:59,048 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:20:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1958706504, now seen corresponding path program 1 times [2025-03-08 06:20:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054741999] [2025-03-08 06:20:59,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:20:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:20:59,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:59,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:59,217 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:20:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054741999] [2025-03-08 06:20:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054741999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:20:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215754386] [2025-03-08 06:20:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:20:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:20:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:20:59,218 INFO L87 Difference]: Start difference. First operand 15545 states and 22754 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:00,206 INFO L93 Difference]: Finished difference Result 19830 states and 28815 transitions. [2025-03-08 06:21:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 06:21:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:00,226 INFO L225 Difference]: With dead ends: 19830 [2025-03-08 06:21:00,226 INFO L226 Difference]: Without dead ends: 19762 [2025-03-08 06:21:00,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:21:00,231 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 6829 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6829 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:00,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6829 Valid, 3229 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:21:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2025-03-08 06:21:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 15540. [2025-03-08 06:21:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15540 states, 15533 states have (on average 1.4643018090516964) internal successors, (22745), 15539 states have internal predecessors, (22745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15540 states to 15540 states and 22745 transitions. [2025-03-08 06:21:00,387 INFO L78 Accepts]: Start accepts. Automaton has 15540 states and 22745 transitions. Word has length 72 [2025-03-08 06:21:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:00,387 INFO L471 AbstractCegarLoop]: Abstraction has 15540 states and 22745 transitions. [2025-03-08 06:21:00,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 15540 states and 22745 transitions. [2025-03-08 06:21:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:21:00,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:00,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:21:00,389 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:00,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 298845499, now seen corresponding path program 1 times [2025-03-08 06:21:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690802491] [2025-03-08 06:21:00,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:00,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:21:00,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:21:00,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:00,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690802491] [2025-03-08 06:21:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690802491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630425651] [2025-03-08 06:21:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:00,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:00,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:00,556 INFO L87 Difference]: Start difference. First operand 15540 states and 22745 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:01,630 INFO L93 Difference]: Finished difference Result 19830 states and 28811 transitions. [2025-03-08 06:21:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:21:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 06:21:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:01,653 INFO L225 Difference]: With dead ends: 19830 [2025-03-08 06:21:01,653 INFO L226 Difference]: Without dead ends: 19762 [2025-03-08 06:21:01,660 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:21:01,660 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 4999 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4999 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:01,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4999 Valid, 3289 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:21:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2025-03-08 06:21:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 15536. [2025-03-08 06:21:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15536 states, 15529 states have (on average 1.46435700946616) internal successors, (22740), 15535 states have internal predecessors, (22740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15536 states to 15536 states and 22740 transitions. [2025-03-08 06:21:01,824 INFO L78 Accepts]: Start accepts. Automaton has 15536 states and 22740 transitions. Word has length 72 [2025-03-08 06:21:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:01,824 INFO L471 AbstractCegarLoop]: Abstraction has 15536 states and 22740 transitions. [2025-03-08 06:21:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15536 states and 22740 transitions. [2025-03-08 06:21:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:21:01,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:01,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:01,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:21:01,827 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1489074189, now seen corresponding path program 1 times [2025-03-08 06:21:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257451799] [2025-03-08 06:21:01,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:01,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:21:01,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:21:01,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:01,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:02,104 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:21:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257451799] [2025-03-08 06:21:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257451799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:21:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316184369] [2025-03-08 06:21:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:21:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:02,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:21:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:21:02,105 INFO L87 Difference]: Start difference. First operand 15536 states and 22740 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:02,601 INFO L93 Difference]: Finished difference Result 26256 states and 38527 transitions. [2025-03-08 06:21:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 06:21:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:21:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:02,631 INFO L225 Difference]: With dead ends: 26256 [2025-03-08 06:21:02,631 INFO L226 Difference]: Without dead ends: 26122 [2025-03-08 06:21:02,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:21:02,641 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 6048 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6048 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:02,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6048 Valid, 3726 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:21:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26122 states. [2025-03-08 06:21:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26122 to 15465. [2025-03-08 06:21:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15465 states, 15461 states have (on average 1.464782355604424) internal successors, (22647), 15464 states have internal predecessors, (22647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15465 states to 15465 states and 22647 transitions. [2025-03-08 06:21:02,826 INFO L78 Accepts]: Start accepts. Automaton has 15465 states and 22647 transitions. Word has length 74 [2025-03-08 06:21:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:02,826 INFO L471 AbstractCegarLoop]: Abstraction has 15465 states and 22647 transitions. [2025-03-08 06:21:02,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15465 states and 22647 transitions. [2025-03-08 06:21:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:21:02,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:02,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:21:02,829 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1426386485, now seen corresponding path program 1 times [2025-03-08 06:21:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377262562] [2025-03-08 06:21:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:02,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:21:02,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:21:02,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:02,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:03,223 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:21:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377262562] [2025-03-08 06:21:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377262562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:03,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:21:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449295541] [2025-03-08 06:21:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:03,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:21:03,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:03,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:21:03,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:21:03,224 INFO L87 Difference]: Start difference. First operand 15465 states and 22647 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:03,971 INFO L93 Difference]: Finished difference Result 45342 states and 66646 transitions. [2025-03-08 06:21:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:21:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:21:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:04,022 INFO L225 Difference]: With dead ends: 45342 [2025-03-08 06:21:04,022 INFO L226 Difference]: Without dead ends: 45275 [2025-03-08 06:21:04,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:21:04,037 INFO L435 NwaCegarLoop]: 1156 mSDtfsCounter, 9631 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9631 SdHoareTripleChecker+Valid, 6521 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:04,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9631 Valid, 6521 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:21:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45275 states. [2025-03-08 06:21:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45275 to 15461. [2025-03-08 06:21:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15461 states, 15458 states have (on average 1.4647431750549877) internal successors, (22642), 15460 states have internal predecessors, (22642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15461 states to 15461 states and 22642 transitions. [2025-03-08 06:21:04,290 INFO L78 Accepts]: Start accepts. Automaton has 15461 states and 22642 transitions. Word has length 74 [2025-03-08 06:21:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 15461 states and 22642 transitions. [2025-03-08 06:21:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15461 states and 22642 transitions. [2025-03-08 06:21:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:21:04,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:04,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:04,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:21:04,293 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -600809324, now seen corresponding path program 1 times [2025-03-08 06:21:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223312857] [2025-03-08 06:21:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:04,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:21:04,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:21:04,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:04,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:04,650 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:21:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223312857] [2025-03-08 06:21:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223312857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:21:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110306904] [2025-03-08 06:21:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:21:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:21:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:21:04,652 INFO L87 Difference]: Start difference. First operand 15461 states and 22642 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:05,683 INFO L93 Difference]: Finished difference Result 45334 states and 66637 transitions. [2025-03-08 06:21:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:21:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:21:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:05,741 INFO L225 Difference]: With dead ends: 45334 [2025-03-08 06:21:05,742 INFO L226 Difference]: Without dead ends: 45267 [2025-03-08 06:21:05,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:21:05,758 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 8157 mSDsluCounter, 8134 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8157 SdHoareTripleChecker+Valid, 9276 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:05,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8157 Valid, 9276 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45267 states. [2025-03-08 06:21:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45267 to 15457. [2025-03-08 06:21:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15457 states, 15455 states have (on average 1.4647039792947267) internal successors, (22637), 15456 states have internal predecessors, (22637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15457 states to 15457 states and 22637 transitions. [2025-03-08 06:21:06,088 INFO L78 Accepts]: Start accepts. Automaton has 15457 states and 22637 transitions. Word has length 74 [2025-03-08 06:21:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,088 INFO L471 AbstractCegarLoop]: Abstraction has 15457 states and 22637 transitions. [2025-03-08 06:21:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 15457 states and 22637 transitions. [2025-03-08 06:21:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:21:06,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,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] [2025-03-08 06:21:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:21:06,091 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:06,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,091 INFO L85 PathProgramCache]: Analyzing trace with hash 723664881, now seen corresponding path program 1 times [2025-03-08 06:21:06,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452255777] [2025-03-08 06:21:06,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:21:06,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:21:06,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,925 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:21:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452255777] [2025-03-08 06:21:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452255777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 06:21:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169552224] [2025-03-08 06:21:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:21:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:21:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:21:06,926 INFO L87 Difference]: Start difference. First operand 15457 states and 22637 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:10,318 INFO L93 Difference]: Finished difference Result 35184 states and 51415 transitions. [2025-03-08 06:21:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:21:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:21:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:10,360 INFO L225 Difference]: With dead ends: 35184 [2025-03-08 06:21:10,361 INFO L226 Difference]: Without dead ends: 35111 [2025-03-08 06:21:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 06:21:10,374 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 9996 mSDsluCounter, 14716 mSDsCounter, 0 mSdLazyCounter, 6649 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9996 SdHoareTripleChecker+Valid, 15932 SdHoareTripleChecker+Invalid, 6681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:10,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9996 Valid, 15932 Invalid, 6681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 6649 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 06:21:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35111 states. [2025-03-08 06:21:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35111 to 15474. [2025-03-08 06:21:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15474 states, 15472 states have (on average 1.4644519131334022) internal successors, (22658), 15473 states have internal predecessors, (22658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15474 states to 15474 states and 22658 transitions. [2025-03-08 06:21:10,603 INFO L78 Accepts]: Start accepts. Automaton has 15474 states and 22658 transitions. Word has length 74 [2025-03-08 06:21:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:10,603 INFO L471 AbstractCegarLoop]: Abstraction has 15474 states and 22658 transitions. [2025-03-08 06:21:10,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 15474 states and 22658 transitions. [2025-03-08 06:21:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:21:10,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:10,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:10,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:21:10,606 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash -392293888, now seen corresponding path program 1 times [2025-03-08 06:21:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988190670] [2025-03-08 06:21:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:10,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:21:10,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:21:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:10,955 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:21:10,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988190670] [2025-03-08 06:21:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988190670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:10,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:10,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:21:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980899906] [2025-03-08 06:21:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:10,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:21:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:10,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:21:10,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:21:10,957 INFO L87 Difference]: Start difference. First operand 15474 states and 22658 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:12,024 INFO L93 Difference]: Finished difference Result 31409 states and 45934 transitions. [2025-03-08 06:21:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:21:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-08 06:21:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:12,061 INFO L225 Difference]: With dead ends: 31409 [2025-03-08 06:21:12,061 INFO L226 Difference]: Without dead ends: 31304 [2025-03-08 06:21:12,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:21:12,072 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 5743 mSDsluCounter, 6180 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5743 SdHoareTripleChecker+Valid, 7451 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:12,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5743 Valid, 7451 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31304 states. [2025-03-08 06:21:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31304 to 15425. [2025-03-08 06:21:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15425 states, 15424 states have (on average 1.4649247925311204) internal successors, (22595), 15424 states have internal predecessors, (22595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15425 states to 15425 states and 22595 transitions. [2025-03-08 06:21:12,287 INFO L78 Accepts]: Start accepts. Automaton has 15425 states and 22595 transitions. Word has length 75 [2025-03-08 06:21:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:12,287 INFO L471 AbstractCegarLoop]: Abstraction has 15425 states and 22595 transitions. [2025-03-08 06:21:12,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15425 states and 22595 transitions. [2025-03-08 06:21:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:21:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:12,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:21:12,291 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1721098331, now seen corresponding path program 1 times [2025-03-08 06:21:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740528273] [2025-03-08 06:21:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:12,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:21:12,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:21:12,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:12,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:12,366 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:21:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740528273] [2025-03-08 06:21:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740528273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602117823] [2025-03-08 06:21:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:21:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:12,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:21:12,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:21:12,367 INFO L87 Difference]: Start difference. First operand 15425 states and 22595 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:12,577 INFO L93 Difference]: Finished difference Result 58462 states and 86363 transitions. [2025-03-08 06:21:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:21:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 06:21:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:12,633 INFO L225 Difference]: With dead ends: 58462 [2025-03-08 06:21:12,633 INFO L226 Difference]: Without dead ends: 44380 [2025-03-08 06:21:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:12,658 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 4333 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:12,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 2584 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44380 states. [2025-03-08 06:21:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44380 to 28730. [2025-03-08 06:21:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28730 states, 28729 states have (on average 1.4573427547077866) internal successors, (41868), 28729 states have internal predecessors, (41868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28730 states to 28730 states and 41868 transitions. [2025-03-08 06:21:13,036 INFO L78 Accepts]: Start accepts. Automaton has 28730 states and 41868 transitions. Word has length 80 [2025-03-08 06:21:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:13,036 INFO L471 AbstractCegarLoop]: Abstraction has 28730 states and 41868 transitions. [2025-03-08 06:21:13,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28730 states and 41868 transitions. [2025-03-08 06:21:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:21:13,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:13,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:13,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:21:13,040 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:13,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1730912320, now seen corresponding path program 1 times [2025-03-08 06:21:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041247577] [2025-03-08 06:21:13,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:13,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:21:13,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:21:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041247577] [2025-03-08 06:21:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041247577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147698631] [2025-03-08 06:21:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:21:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:13,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:21:13,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:21:13,141 INFO L87 Difference]: Start difference. First operand 28730 states and 41868 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:13,317 INFO L93 Difference]: Finished difference Result 48312 states and 70438 transitions. [2025-03-08 06:21:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:21:13,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 06:21:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:13,341 INFO L225 Difference]: With dead ends: 48312 [2025-03-08 06:21:13,342 INFO L226 Difference]: Without dead ends: 20908 [2025-03-08 06:21:13,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:21:13,363 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 3178 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3178 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:13,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3178 Valid, 1802 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20908 states. [2025-03-08 06:21:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20908 to 20902. [2025-03-08 06:21:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20902 states, 20901 states have (on average 1.4425625568154634) internal successors, (30151), 20901 states have internal predecessors, (30151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20902 states to 20902 states and 30151 transitions. [2025-03-08 06:21:13,642 INFO L78 Accepts]: Start accepts. Automaton has 20902 states and 30151 transitions. Word has length 81 [2025-03-08 06:21:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 20902 states and 30151 transitions. [2025-03-08 06:21:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20902 states and 30151 transitions. [2025-03-08 06:21:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:21:13,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:13,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:21:13,647 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-08 06:21:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1507674445, now seen corresponding path program 1 times [2025-03-08 06:21:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507457876] [2025-03-08 06:21:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:21:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:21:13,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:13,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:13,723 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:21:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507457876] [2025-03-08 06:21:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507457876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182565823] [2025-03-08 06:21:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:13,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:13,724 INFO L87 Difference]: Start difference. First operand 20902 states and 30151 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:13,874 INFO L93 Difference]: Finished difference Result 58600 states and 84929 transitions. [2025-03-08 06:21:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 06:21:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:13,918 INFO L225 Difference]: With dead ends: 58600 [2025-03-08 06:21:13,918 INFO L226 Difference]: Without dead ends: 39024 [2025-03-08 06:21:13,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:13,940 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 717 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:13,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1715 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39024 states. [2025-03-08 06:21:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39024 to 37070. [2025-03-08 06:21:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37070 states, 37069 states have (on average 1.4409074968302356) internal successors, (53413), 37069 states have internal predecessors, (53413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)