./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.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_opt-floodmax.4.3.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 302eaca9e8e704fce616bff255988404999820a5e9f781141e7fa044e1ce9ad1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:24:23,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:24:23,110 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:24:23,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:24:23,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:24:23,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:24:23,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:24:23,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:24:23,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:24:23,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:24:23,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:24:23,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:24:23,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:24:23,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:24:23,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:24:23,130 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:24:23,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:23,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:24:23,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:24:23,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:24:23,132 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 -> 302eaca9e8e704fce616bff255988404999820a5e9f781141e7fa044e1ce9ad1 [2025-02-07 21:24:23,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:24:23,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:24:23,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:24:23,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:24:23,364 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:24:23,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:24,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2ea773/10b73e1cbbc2453a9bf8ea14f5a91cfa/FLAG532e06368 [2025-02-07 21:24:24,835 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:24:24,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:24,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2ea773/10b73e1cbbc2453a9bf8ea14f5a91cfa/FLAG532e06368 [2025-02-07 21:24:25,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2ea773/10b73e1cbbc2453a9bf8ea14f5a91cfa [2025-02-07 21:24:25,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:24:25,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:24:25,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:25,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:24:25,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:24:25,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:25" (1/1) ... [2025-02-07 21:24:25,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:25, skipping insertion in model container [2025-02-07 21:24:25,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:25" (1/1) ... [2025-02-07 21:24:25,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:24:25,602 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35004,35017] [2025-02-07 21:24:25,615 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35894,35907] [2025-02-07 21:24:25,630 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37724,37737] [2025-02-07 21:24:25,644 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38998,39011] [2025-02-07 21:24:25,726 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53711,53724] [2025-02-07 21:24:25,789 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62997,63010] [2025-02-07 21:24:25,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63890,63903] [2025-02-07 21:24:25,811 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[65723,65736] [2025-02-07 21:24:25,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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[66616,66629] [2025-02-07 21:24:25,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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[69389,69402] [2025-02-07 21:24:25,847 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[70282,70295] [2025-02-07 21:24:25,861 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[72115,72128] [2025-02-07 21:24:25,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:25,913 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:24:26,077 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35004,35017] [2025-02-07 21:24:26,085 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35894,35907] [2025-02-07 21:24:26,100 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37724,37737] [2025-02-07 21:24:26,110 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38998,39011] [2025-02-07 21:24:26,178 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53711,53724] [2025-02-07 21:24:26,230 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62997,63010] [2025-02-07 21:24:26,237 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63890,63903] [2025-02-07 21:24:26,249 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[65723,65736] [2025-02-07 21:24:26,256 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[66616,66629] [2025-02-07 21:24:26,272 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[69389,69402] [2025-02-07 21:24:26,279 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[70282,70295] [2025-02-07 21:24:26,291 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[72115,72128] [2025-02-07 21:24:26,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:26,351 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:24:26,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26 WrapperNode [2025-02-07 21:24:26,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:26,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:26,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:24:26,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:24:26,357 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:24:26" (1/1) ... [2025-02-07 21:24:26,379 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:24:26" (1/1) ... [2025-02-07 21:24:26,453 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4342 [2025-02-07 21:24:26,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:26,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:24:26,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:24:26,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:24:26,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,515 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:24:26,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:24:26,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:24:26,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:24:26,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:24:26,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (1/1) ... [2025-02-07 21:24:26,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:24:26,616 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:24:26,619 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:24:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:24:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:24:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:24:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:24:26,778 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:24:26,779 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:24:28,938 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3672: havoc main_~check__tmp~11#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5127: havoc main_~check__tmp~21#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: havoc main_~node1__newmax~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3545: havoc main_~node4__newmax~8#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5000: havoc main_~node4__newmax~13#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: havoc main_~node4__newmax~7#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~node2__newmax~7#1; [2025-02-07 21:24:28,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3817: havoc main_~node4__newmax~9#1; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4878: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841: havoc main_~node1__newmax~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__newmax~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1;#t~ret48#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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node4__newmax~5#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~check__tmp~9#1, main_~node4____CPAchecker_TMP_2~3#1, main_~node4____CPAchecker_TMP_1~3#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__newmax~7#1, main_~node3____CPAchecker_TMP_2~3#1, main_~node3____CPAchecker_TMP_1~3#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__newmax~6#1, main_~node2____CPAchecker_TMP_2~3#1, main_~node2____CPAchecker_TMP_1~3#1, main_~node2____CPAchecker_TMP_0~3#1, main_~node2__newmax~6#1, main_~node1____CPAchecker_TMP_2~3#1, main_~node1____CPAchecker_TMP_1~3#1, main_~node1____CPAchecker_TMP_0~3#1, main_~node1__newmax~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~node4__newmax~6#1, main_~node3__newmax~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~check__tmp~11#1, main_~node4__newmax~8#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__newmax~9#1, main_~node3__newmax~7#1, main_~node2__newmax~5#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__newmax~10#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__newmax~11#1, main_~node3__newmax~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__newmax~12#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~check__tmp~21#1, main_~node4__newmax~13#1, main_~node3__newmax~9#1, main_~node2__newmax~7#1, main_~node1__newmax~5#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~node4____CPAchecker_TMP_2~2#1, main_~node4____CPAchecker_TMP_1~2#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__newmax~4#1, main_~node3____CPAchecker_TMP_2~2#1, main_~node3____CPAchecker_TMP_1~2#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__newmax~4#1, main_~node2____CPAchecker_TMP_2~2#1, main_~node2____CPAchecker_TMP_1~2#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__newmax~4#1, main_~node1____CPAchecker_TMP_2~2#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__newmax~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__newmax~3#1, main_~node3__newmax~3#1, main_~node2__newmax~3#1, main_~node1__newmax~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_2~1#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__newmax~2#1, main_~node3____CPAchecker_TMP_2~1#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_2~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_2~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__newmax~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_2~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__newmax~0#1, main_~node3____CPAchecker_TMP_2~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_2~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_2~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4751: havoc main_~node3__newmax~9#1; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979: havoc main_~node4__newmax~5#1; [2025-02-07 21:24:28,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4505: havoc main_~node4__newmax~11#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2263: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2400: havoc main_~node2__newmax~6#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-02-07 21:24:28,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4256: havoc main_~node3__newmax~8#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887: havoc main_~node2__newmax~5#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4797: havoc main_~node4__newmax~12#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4935: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4013: havoc main_~check__tmp~13#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2562: havoc main_~check__tmp~9#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~check__tmp~12#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5081: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: havoc main_~node3__newmax~7#1; [2025-02-07 21:24:28,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc main_~node3__newmax~6#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2182: havoc main_~node4__newmax~6#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4302: havoc main_~node4__newmax~10#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2060: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4440: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1933: havoc main_~node3__newmax~5#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:28,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4586: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2025-02-07 21:24:29,145 INFO L? ?]: Removed 871 outVars from TransFormulas that were not future-live. [2025-02-07 21:24:29,146 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:24:29,175 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:24:29,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:24:29,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:29 BoogieIcfgContainer [2025-02-07 21:24:29,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:24:29,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:24:29,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:24:29,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:24:29,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:24:25" (1/3) ... [2025-02-07 21:24:29,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51287358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:29, skipping insertion in model container [2025-02-07 21:24:29,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:26" (2/3) ... [2025-02-07 21:24:29,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51287358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:29, skipping insertion in model container [2025-02-07 21:24:29,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:29" (3/3) ... [2025-02-07 21:24:29,190 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:29,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:24:29,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1162 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-07 21:24:29,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:24:29,283 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;@23b04198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:24:29,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-07 21:24:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 1161 states, 814 states have (on average 1.9987714987714988) internal successors, (1627), 1160 states have internal predecessors, (1627), 0 states have call successors, (0), 0 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:24:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-07 21:24:29,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:29,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:29,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:29,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 288432941, now seen corresponding path program 1 times [2025-02-07 21:24:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82591195] [2025-02-07 21:24:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:29,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-07 21:24:29,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-07 21:24:29,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:29,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:37,792 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:24:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82591195] [2025-02-07 21:24:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82591195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:37,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:24:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476905631] [2025-02-07 21:24:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:24:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:37,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:24:37,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:24:37,821 INFO L87 Difference]: Start difference. First operand has 1161 states, 814 states have (on average 1.9987714987714988) internal successors, (1627), 1160 states have internal predecessors, (1627), 0 states have call successors, (0), 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 27 states, 27 states have (on average 15.37037037037037) internal successors, (415), 27 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:39,678 INFO L93 Difference]: Finished difference Result 1197 states and 1627 transitions. [2025-02-07 21:24:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-07 21:24:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.37037037037037) internal successors, (415), 27 states have internal predecessors, (415), 0 states have call successors, (0), 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 415 [2025-02-07 21:24:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:39,692 INFO L225 Difference]: With dead ends: 1197 [2025-02-07 21:24:39,693 INFO L226 Difference]: Without dead ends: 533 [2025-02-07 21:24:39,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1200, Invalid=2960, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 21:24:39,702 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 5915 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5915 SdHoareTripleChecker+Valid, 11528 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:39,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5915 Valid, 11528 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 21:24:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-07 21:24:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-02-07 21:24:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 525 states have (on average 1.0133333333333334) internal successors, (532), 532 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:24:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 532 transitions. [2025-02-07 21:24:39,748 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 532 transitions. Word has length 415 [2025-02-07 21:24:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:39,749 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 532 transitions. [2025-02-07 21:24:39,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.37037037037037) internal successors, (415), 27 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 532 transitions. [2025-02-07 21:24:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-07 21:24:39,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:39,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:39,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:24:39,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:39,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash -526861491, now seen corresponding path program 1 times [2025-02-07 21:24:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278926185] [2025-02-07 21:24:39,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-07 21:24:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-07 21:24:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:42,656 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:24:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278926185] [2025-02-07 21:24:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278926185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:42,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:42,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-07 21:24:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359179287] [2025-02-07 21:24:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:42,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 21:24:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:42,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 21:24:42,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:24:42,663 INFO L87 Difference]: Start difference. First operand 533 states and 532 transitions. Second operand has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:42,944 INFO L93 Difference]: Finished difference Result 533 states and 532 transitions. [2025-02-07 21:24:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:24:42,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 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 415 [2025-02-07 21:24:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:42,947 INFO L225 Difference]: With dead ends: 533 [2025-02-07 21:24:42,947 INFO L226 Difference]: Without dead ends: 468 [2025-02-07 21:24:42,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:24:42,948 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 728 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:42,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2053 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:24:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-07 21:24:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-07 21:24:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 464 states have (on average 1.0064655172413792) internal successors, (467), 467 states have internal predecessors, (467), 0 states have call successors, (0), 0 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:24:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 467 transitions. [2025-02-07 21:24:42,960 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 467 transitions. Word has length 415 [2025-02-07 21:24:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:42,966 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 467 transitions. [2025-02-07 21:24:42,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 467 transitions. [2025-02-07 21:24:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-07 21:24:42,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:42,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:42,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:24:42,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1587463149, now seen corresponding path program 1 times [2025-02-07 21:24:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170830701] [2025-02-07 21:24:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-07 21:24:43,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-07 21:24:43,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:45,378 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:24:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170830701] [2025-02-07 21:24:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170830701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-07 21:24:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871038346] [2025-02-07 21:24:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 21:24:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 21:24:45,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:24:45,382 INFO L87 Difference]: Start difference. First operand 468 states and 467 transitions. Second operand has 14 states, 14 states have (on average 29.642857142857142) internal successors, (415), 14 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:45,617 INFO L93 Difference]: Finished difference Result 468 states and 467 transitions. [2025-02-07 21:24:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:24:45,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 29.642857142857142) internal successors, (415), 14 states have internal predecessors, (415), 0 states have call successors, (0), 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 415 [2025-02-07 21:24:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:45,620 INFO L225 Difference]: With dead ends: 468 [2025-02-07 21:24:45,620 INFO L226 Difference]: Without dead ends: 416 [2025-02-07 21:24:45,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:24:45,621 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 434 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:45,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2022 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:24:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-07 21:24:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-07 21:24:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.0) internal successors, (415), 415 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 415 transitions. [2025-02-07 21:24:45,635 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 415 transitions. Word has length 415 [2025-02-07 21:24:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:45,636 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 415 transitions. [2025-02-07 21:24:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 29.642857142857142) internal successors, (415), 14 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 415 transitions. [2025-02-07 21:24:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-07 21:24:45,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:45,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:24:45,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 932188429, now seen corresponding path program 1 times [2025-02-07 21:24:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558232326] [2025-02-07 21:24:45,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:45,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-07 21:24:45,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-07 21:24:45,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:45,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:48,252 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:24:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558232326] [2025-02-07 21:24:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558232326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-07 21:24:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497089255] [2025-02-07 21:24:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 21:24:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:48,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 21:24:48,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:24:48,254 INFO L87 Difference]: Start difference. First operand 416 states and 415 transitions. Second operand has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:48,457 INFO L93 Difference]: Finished difference Result 416 states and 415 transitions. [2025-02-07 21:24:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:24:48,458 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 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 415 [2025-02-07 21:24:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:48,458 INFO L225 Difference]: With dead ends: 416 [2025-02-07 21:24:48,458 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:24:48,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:24:48,460 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 414 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:48,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2080 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:24:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:24:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:24:48,462 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:24:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:24:48,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 415 [2025-02-07 21:24:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:48,463 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:24:48,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.666666666666668) internal successors, (415), 15 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:24:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:24:48,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:24:48,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2025-02-07 21:24:48,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2025-02-07 21:24:48,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2025-02-07 21:24:48,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:24:48,471 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 21:24:48,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:24:48,478 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:24:48,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:24:48 BoogieIcfgContainer [2025-02-07 21:24:48,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:24:48,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:24:48,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:24:48,489 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:24:48,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:29" (3/4) ... [2025-02-07 21:24:48,491 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:24:48,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:24:48,544 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:24:48,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:24:48,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:24:48,727 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:24:48,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:24:48,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:24:48,729 INFO L158 Benchmark]: Toolchain (without parser) took 23660.07ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 101.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 433.2MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,730 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:24:48,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1283.19ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 92.4MB in the end (delta: 7.9MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.01ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 72.7MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,732 INFO L158 Benchmark]: Boogie Preprocessor took 133.91ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 59.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,732 INFO L158 Benchmark]: IcfgBuilder took 2592.77ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 59.3MB in the beginning and 239.4MB in the end (delta: -180.1MB). Peak memory consumption was 199.3MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,732 INFO L158 Benchmark]: TraceAbstraction took 19304.25ms. Allocated memory was 377.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 239.4MB in the beginning and 1.2GB in the end (delta: -959.9MB). Peak memory consumption was 302.3MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,732 INFO L158 Benchmark]: Witness Printer took 239.42ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 21:24:48,733 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1283.19ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 92.4MB in the end (delta: 7.9MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.01ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 72.7MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.91ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 59.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2592.77ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 59.3MB in the beginning and 239.4MB in the end (delta: -180.1MB). Peak memory consumption was 199.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19304.25ms. Allocated memory was 377.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 239.4MB in the beginning and 1.2GB in the end (delta: -959.9MB). Peak memory consumption was 302.3MB. Max. memory is 16.1GB. * Witness Printer took 239.42ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. 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: 2067]: 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: 2124]: 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: 2270]: 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: 2349]: 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: 3633]: 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: 4390]: 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: 4447]: 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: 4593]: 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: 4650]: 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: 4885]: 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: 4942]: 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: 5088]: 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, 1162 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7491 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7491 mSDsluCounter, 17683 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15152 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2089 IncrementalHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 2531 mSDtfsCounter, 2089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=0, InterpolantAutomatonStates: 96, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1660 NumberOfCodeBlocks, 1660 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 1656 ConstructedInterpolants, 0 QuantifiedInterpolants, 8517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:24:48,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE