./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:58,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:58,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:22:58,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:58,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:58,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:58,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:58,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:58,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:58,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:58,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:58,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:58,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:58,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:58,330 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:58,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:58,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:58,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:58,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:58,332 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2025-02-07 21:22:58,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:58,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:58,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:58,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:58,605 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:58,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:59,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c4a52074/928e799cc82045239a006fbe776cfc4d/FLAG5cef36882 [2025-02-07 21:23:00,151 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:23:00,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:23:00,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c4a52074/928e799cc82045239a006fbe776cfc4d/FLAG5cef36882 [2025-02-07 21:23:00,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c4a52074/928e799cc82045239a006fbe776cfc4d [2025-02-07 21:23:00,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:23:00,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:23:00,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:23:00,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:23:00,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:23:00,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:00,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e708cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00, skipping insertion in model container [2025-02-07 21:23:00,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:00,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:23:00,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2025-02-07 21:23:00,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2025-02-07 21:23:00,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2025-02-07 21:23:00,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2025-02-07 21:23:00,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2025-02-07 21:23:00,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2025-02-07 21:23:00,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2025-02-07 21:23:00,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2025-02-07 21:23:00,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2025-02-07 21:23:00,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2025-02-07 21:23:00,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2025-02-07 21:23:00,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2025-02-07 21:23:00,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2025-02-07 21:23:00,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2025-02-07 21:23:00,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2025-02-07 21:23:00,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2025-02-07 21:23:00,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:23:00,738 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:23:00,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2025-02-07 21:23:00,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2025-02-07 21:23:00,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2025-02-07 21:23:00,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2025-02-07 21:23:00,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2025-02-07 21:23:00,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2025-02-07 21:23:00,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2025-02-07 21:23:00,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2025-02-07 21:23:00,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2025-02-07 21:23:00,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2025-02-07 21:23:00,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2025-02-07 21:23:00,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2025-02-07 21:23:00,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2025-02-07 21:23:00,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2025-02-07 21:23:00,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2025-02-07 21:23:00,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2025-02-07 21:23:00,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:23:00,969 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:23:00,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00 WrapperNode [2025-02-07 21:23:00,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:23:00,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:23:00,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:23:00,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:23:00,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,075 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3577 [2025-02-07 21:23:01,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:23:01,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:23:01,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:23:01,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:23:01,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,138 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-02-07 21:23:01,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:23:01,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:23:01,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:23:01,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:23:01,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (1/1) ... [2025-02-07 21:23:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:23:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:23:01,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:23:01,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:23:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:23:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:23:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:23:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:23:01,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:23:01,413 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node3__m3~3#1; [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node2__m2~2#1; [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2551: havoc main_~node5__m5~14#1; [2025-02-07 21:23:02,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5524: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4996: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3609: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: havoc main_~node4__m4~7#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: havoc main_~node5__m5~10#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4338: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: havoc main_~check__tmp~25#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:23:02,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3945: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret25#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node5__m5~11#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: havoc main_~node5__m5~3#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4674: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: havoc main_~node4__m4~9#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: havoc main_~check__tmp~20#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1771: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~4#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc main_~node2__m2~1#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-02-07 21:23:02,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2304: havoc main_~node5__m5~12#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5013: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4287: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~check__tmp~22#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-07 21:23:02,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5349: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: havoc main_~node2__m2~3#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720: havoc main_~node4__m4~5#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1456: havoc main_~node5__m5~6#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~1#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L796: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4496: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc main_~node4__m4~2#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129: havoc main_~node4__m4~3#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~node5__m5~7#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5030: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4832: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4304: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~node3__m3~5#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~check__tmp~13#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995: havoc main_~node3__m3~4#1; [2025-02-07 21:23:02,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5366: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3253: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~node5__m5~17#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735: havoc main_~node5__m5~8#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L414: havoc main_~node4__m4~1#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2198: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3784: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1144: havoc main_~node5__m5~4#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~check__tmp~15#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4120: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3592: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: havoc main_~node4__m4~8#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1281: havoc main_~node5__m5~5#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-02-07 21:23:02,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4321: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: havoc main_~node4__m4~6#1; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-07 21:23:02,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1351: havoc main_~check__tmp~9#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1551: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4657: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-02-07 21:23:02,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5188: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-02-07 21:23:03,082 INFO L? ?]: Removed 891 outVars from TransFormulas that were not future-live. [2025-02-07 21:23:03,082 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:23:03,097 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:23:03,098 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:23:03,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:03 BoogieIcfgContainer [2025-02-07 21:23:03,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:23:03,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:23:03,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:23:03,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:23:03,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:23:00" (1/3) ... [2025-02-07 21:23:03,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111258ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:23:03, skipping insertion in model container [2025-02-07 21:23:03,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:23:00" (2/3) ... [2025-02-07 21:23:03,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111258ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:23:03, skipping insertion in model container [2025-02-07 21:23:03,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:03" (3/3) ... [2025-02-07 21:23:03,105 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:23:03,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:23:03,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 630 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 21:23:03,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:23:03,204 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;@311c83a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:23:03,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 21:23:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 519 states have (on average 1.998073217726397) internal successors, (1037), 628 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:03,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:03,236 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-02-07 21:23:03,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 351905829, now seen corresponding path program 1 times [2025-02-07 21:23:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091942548] [2025-02-07 21:23:03,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:03,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:03,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:03,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:03,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:04,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091942548] [2025-02-07 21:23:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091942548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:04,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:23:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185126871] [2025-02-07 21:23:04,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:04,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:23:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:04,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:23:04,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:23:04,510 INFO L87 Difference]: Start difference. First operand has 629 states, 519 states have (on average 1.998073217726397) internal successors, (1037), 628 states have internal predecessors, (1037), 0 states have call successors, (0), 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 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:05,678 INFO L93 Difference]: Finished difference Result 647 states and 1037 transitions. [2025-02-07 21:23:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:23:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:05,688 INFO L225 Difference]: With dead ends: 647 [2025-02-07 21:23:05,690 INFO L226 Difference]: Without dead ends: 201 [2025-02-07 21:23:05,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:05,700 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 4368 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4368 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:05,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4368 Valid, 4147 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:23:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-07 21:23:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-07 21:23:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 189 states have (on average 1.0582010582010581) internal successors, (200), 200 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 200 transitions. [2025-02-07 21:23:05,736 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 200 transitions. Word has length 74 [2025-02-07 21:23:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 200 transitions. [2025-02-07 21:23:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 200 transitions. [2025-02-07 21:23:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:05,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:05,738 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-02-07 21:23:05,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:23:05,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 70624583, now seen corresponding path program 1 times [2025-02-07 21:23:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33021346] [2025-02-07 21:23:05,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:05,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:05,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:05,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:05,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33021346] [2025-02-07 21:23:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33021346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:23:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328293051] [2025-02-07 21:23:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:07,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 21:23:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:07,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 21:23:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2025-02-07 21:23:07,892 INFO L87 Difference]: Start difference. First operand 201 states and 200 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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-02-07 21:23:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:09,962 INFO L93 Difference]: Finished difference Result 201 states and 200 transitions. [2025-02-07 21:23:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 21:23:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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-02-07 21:23:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:09,964 INFO L225 Difference]: With dead ends: 201 [2025-02-07 21:23:09,964 INFO L226 Difference]: Without dead ends: 196 [2025-02-07 21:23:09,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=400, Invalid=2252, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 21:23:09,966 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 608 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:09,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1994 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 21:23:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-07 21:23:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-07 21:23:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 185 states have (on average 1.054054054054054) internal successors, (195), 195 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 195 transitions. [2025-02-07 21:23:09,972 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 195 transitions. Word has length 74 [2025-02-07 21:23:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:09,972 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 195 transitions. [2025-02-07 21:23:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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-02-07 21:23:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 195 transitions. [2025-02-07 21:23:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:09,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:09,974 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-02-07 21:23:09,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:23:09,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 741989321, now seen corresponding path program 1 times [2025-02-07 21:23:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130706122] [2025-02-07 21:23:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:09,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:10,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130706122] [2025-02-07 21:23:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130706122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041667022] [2025-02-07 21:23:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:10,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:10,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:10,520 INFO L87 Difference]: Start difference. First operand 196 states and 195 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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-02-07 21:23:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:10,822 INFO L93 Difference]: Finished difference Result 196 states and 195 transitions. [2025-02-07 21:23:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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-02-07 21:23:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:10,823 INFO L225 Difference]: With dead ends: 196 [2025-02-07 21:23:10,823 INFO L226 Difference]: Without dead ends: 170 [2025-02-07 21:23:10,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:10,824 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 438 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:10,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1040 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-07 21:23:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-07 21:23:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.0432098765432098) internal successors, (169), 169 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 169 transitions. [2025-02-07 21:23:10,829 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 169 transitions. Word has length 74 [2025-02-07 21:23:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 169 transitions. [2025-02-07 21:23:10,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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-02-07 21:23:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 169 transitions. [2025-02-07 21:23:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:10,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:10,831 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-02-07 21:23:10,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:23:10,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1891586770, now seen corresponding path program 1 times [2025-02-07 21:23:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527631810] [2025-02-07 21:23:10,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:10,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:10,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:10,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:10,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527631810] [2025-02-07 21:23:11,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527631810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:11,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:11,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:23:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370429458] [2025-02-07 21:23:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:11,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:23:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:11,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:23:11,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:23:11,342 INFO L87 Difference]: Start difference. First operand 170 states and 169 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:11,704 INFO L93 Difference]: Finished difference Result 170 states and 169 transitions. [2025-02-07 21:23:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:23:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:11,706 INFO L225 Difference]: With dead ends: 170 [2025-02-07 21:23:11,706 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:23:11,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:11,708 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 308 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:11,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1039 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:23:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-07 21:23:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.0402684563758389) internal successors, (155), 155 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 155 transitions. [2025-02-07 21:23:11,720 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 155 transitions. Word has length 74 [2025-02-07 21:23:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 155 transitions. [2025-02-07 21:23:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 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-02-07 21:23:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 155 transitions. [2025-02-07 21:23:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:11,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:11,721 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-02-07 21:23:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:23:11,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1504334232, now seen corresponding path program 1 times [2025-02-07 21:23:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791564422] [2025-02-07 21:23:11,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:11,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791564422] [2025-02-07 21:23:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791564422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:12,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 21:23:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091988030] [2025-02-07 21:23:12,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:12,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:23:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:12,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:23:12,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:23:12,123 INFO L87 Difference]: Start difference. First operand 156 states and 155 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) 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-02-07 21:23:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:12,365 INFO L93 Difference]: Finished difference Result 156 states and 155 transitions. [2025-02-07 21:23:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:23:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) 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-02-07 21:23:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:12,366 INFO L225 Difference]: With dead ends: 156 [2025-02-07 21:23:12,366 INFO L226 Difference]: Without dead ends: 113 [2025-02-07 21:23:12,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:23:12,367 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 247 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:12,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 519 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-07 21:23:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-07 21:23:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 110 states have (on average 1.018181818181818) internal successors, (112), 112 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 112 transitions. [2025-02-07 21:23:12,376 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 112 transitions. Word has length 74 [2025-02-07 21:23:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:12,377 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 112 transitions. [2025-02-07 21:23:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) 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-02-07 21:23:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 112 transitions. [2025-02-07 21:23:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:12,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:12,377 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-02-07 21:23:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:23:12,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1272954114, now seen corresponding path program 1 times [2025-02-07 21:23:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686971405] [2025-02-07 21:23:12,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:12,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:12,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:12,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:12,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686971405] [2025-02-07 21:23:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686971405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:12,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515552514] [2025-02-07 21:23:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:12,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:12,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:12,853 INFO L87 Difference]: Start difference. First operand 113 states and 112 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 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-02-07 21:23:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:13,100 INFO L93 Difference]: Finished difference Result 113 states and 112 transitions. [2025-02-07 21:23:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:13,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 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-02-07 21:23:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:13,103 INFO L225 Difference]: With dead ends: 113 [2025-02-07 21:23:13,103 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 21:23:13,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:13,105 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 306 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:13,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 474 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 21:23:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-07 21:23:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 105 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 105 transitions. [2025-02-07 21:23:13,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 105 transitions. Word has length 75 [2025-02-07 21:23:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:13,114 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 105 transitions. [2025-02-07 21:23:13,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 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-02-07 21:23:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 105 transitions. [2025-02-07 21:23:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:13,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:13,115 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-02-07 21:23:13,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:23:13,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1716951556, now seen corresponding path program 1 times [2025-02-07 21:23:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988473803] [2025-02-07 21:23:13,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:13,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988473803] [2025-02-07 21:23:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988473803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:23:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771956791] [2025-02-07 21:23:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:23:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:14,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:23:14,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:23:14,445 INFO L87 Difference]: Start difference. First operand 106 states and 105 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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-02-07 21:23:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:15,865 INFO L93 Difference]: Finished difference Result 106 states and 105 transitions. [2025-02-07 21:23:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 21:23:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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-02-07 21:23:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:15,866 INFO L225 Difference]: With dead ends: 106 [2025-02-07 21:23:15,870 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 21:23:15,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=340, Invalid=2012, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 21:23:15,872 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 403 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:15,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 762 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:23:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 21:23:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-07 21:23:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0) internal successors, (95), 95 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 95 transitions. [2025-02-07 21:23:15,875 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 95 transitions. Word has length 75 [2025-02-07 21:23:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:15,878 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 95 transitions. [2025-02-07 21:23:15,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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-02-07 21:23:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 95 transitions. [2025-02-07 21:23:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-07 21:23:15,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:15,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:15,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:23:15,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1227511149, now seen corresponding path program 1 times [2025-02-07 21:23:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651146533] [2025-02-07 21:23:15,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:15,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-07 21:23:15,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 21:23:15,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651146533] [2025-02-07 21:23:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651146533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:23:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169450363] [2025-02-07 21:23:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:23:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:15,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:23:15,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:23:15,991 INFO L87 Difference]: Start difference. First operand 96 states and 95 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:16,008 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2025-02-07 21:23:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:23:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-07 21:23:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:16,012 INFO L225 Difference]: With dead ends: 96 [2025-02-07 21:23:16,013 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:23:16,013 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-02-07 21:23:16,013 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:16,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:23:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:23:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:23:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:23:16,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-02-07 21:23:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:16,014 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:23:16,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:23:16,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:23:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 21:23:16,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 21:23:16,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 21:23:16,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:23:16,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:16,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:23:16,038 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:23:16,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:23:16 BoogieIcfgContainer [2025-02-07 21:23:16,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:23:16,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:23:16,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:23:16,054 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:23:16,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:03" (3/4) ... [2025-02-07 21:23:16,057 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:23:16,099 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:23:16,102 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:23:16,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:23:16,106 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:23:16,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:23:16,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:23:16,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:23:16,349 INFO L158 Benchmark]: Toolchain (without parser) took 16155.68ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 107.6MB in the beginning and 303.1MB in the end (delta: -195.5MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,349 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:23:16,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.73ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 46.7MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.46ms. Allocated memory is still 142.6MB. Free memory was 46.7MB in the beginning and 98.1MB in the end (delta: -51.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,350 INFO L158 Benchmark]: Boogie Preprocessor took 131.38ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 86.3MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,351 INFO L158 Benchmark]: IcfgBuilder took 1889.67ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 45.8MB in the end (delta: 40.5MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,351 INFO L158 Benchmark]: TraceAbstraction took 12953.96ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 44.5MB in the beginning and 336.7MB in the end (delta: -292.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,351 INFO L158 Benchmark]: Witness Printer took 293.88ms. Allocated memory is still 469.8MB. Free memory was 336.7MB in the beginning and 303.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:23:16,352 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.73ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 46.7MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.46ms. Allocated memory is still 142.6MB. Free memory was 46.7MB in the beginning and 98.1MB in the end (delta: -51.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.38ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 86.3MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1889.67ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 45.8MB in the end (delta: 40.5MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12953.96ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 44.5MB in the beginning and 336.7MB in the end (delta: -292.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 293.88ms. Allocated memory is still 469.8MB. Free memory was 336.7MB in the beginning and 303.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 598]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 933]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1025]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1076]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1195]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1246]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1324]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1507]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1558]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1636]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1778]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2076]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2127]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2205]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2347]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2594]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 630 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6730 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6730 mSDsluCounter, 10061 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8478 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3392 IncrementalHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1583 mSDtfsCounter, 3392 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=0, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 12539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:23:16,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE