./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/4SB.i --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/memory-model/4SB.i -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 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:29:43,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:29:43,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:29:43,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:29:43,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:29:43,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:29:43,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:29:43,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:29:43,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:29:43,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:29:43,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:29:43,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:29:43,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:29:43,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:29:43,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:29:43,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:29:43,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:29:43,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:29:43,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:29:43,328 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 -> 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 [2025-02-07 17:29:43,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:29:43,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:29:43,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:29:43,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:29:43,604 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:29:43,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/4SB.i [2025-02-07 17:29:44,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baf7d4145/c4459764984a4583855b013bf969d66f/FLAG4f1005339 [2025-02-07 17:29:45,063 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:29:45,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i [2025-02-07 17:29:45,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baf7d4145/c4459764984a4583855b013bf969d66f/FLAG4f1005339 [2025-02-07 17:29:45,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baf7d4145/c4459764984a4583855b013bf969d66f [2025-02-07 17:29:45,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:29:45,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:29:45,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:29:45,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:29:45,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:29:45,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577939e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45, skipping insertion in model container [2025-02-07 17:29:45,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:29:45,331 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/memory-model/4SB.i[21105,21118] [2025-02-07 17:29:45,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:29:45,343 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:29:45,452 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/memory-model/4SB.i[21105,21118] [2025-02-07 17:29:45,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:29:45,469 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:29:45,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45 WrapperNode [2025-02-07 17:29:45,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:29:45,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:29:45,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:29:45,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:29:45,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,555 INFO L138 Inliner]: procedures = 27, calls = 680, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1617 [2025-02-07 17:29:45,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:29:45,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:29:45,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:29:45,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:29:45,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,598 INFO L175 MemorySlicer]: Split 488 memory accesses to 16 slices as follows [13, 45, 13, 152, 12, 3, 10, 96, 60, 11, 10, 12, 10, 15, 13, 13]. 31 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [5, 0, 5, 0, 5, 0, 0, 0, 0, 0, 1, 10, 0, 0, 5, 5]. The 171 writes are split as follows [2, 15, 2, 80, 2, 2, 5, 20, 20, 5, 3, 1, 5, 5, 2, 2]. [2025-02-07 17:29:45,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:29:45,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:29:45,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:29:45,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:29:45,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (1/1) ... [2025-02-07 17:29:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:29:45,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:45,697 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 17:29:45,699 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 17:29:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_4_conditions [2025-02-07 17:29:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_4_conditions [2025-02-07 17:29:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-02-07 17:29:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-02-07 17:29:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-02-07 17:29:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-02-07 17:29:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-02-07 17:29:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 17:29:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 17:29:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 17:29:45,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-02-07 17:29:45,731 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-02-07 17:29:45,731 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:29:45,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:29:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:29:45,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:29:45,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:29:46,825 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-02-07 17:29:46,825 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-02-07 17:29:47,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-1: assume !((if main_#t~mem64#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem64#1 % 256 % 4294967296 else main_#t~mem64#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem64#1;assume false; [2025-02-07 17:29:47,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-1: assume !!((if main_#t~mem64#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem64#1 % 256 % 4294967296 else main_#t~mem64#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem64#1; [2025-02-07 17:29:47,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-2: assume !(main_~cpu1Writes_issued~0#1 < main_#t~mem63#1);havoc main_#t~mem63#1;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-2: assume !!(main_~cpu1Writes_issued~0#1 < main_#t~mem63#1);havoc main_#t~mem63#1; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-3: assume !(0 == (if main_#t~mem75#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem75#1 % 256 % 4294967296 else main_#t~mem75#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem75#1;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-3: assume !!(0 == (if main_#t~mem75#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem75#1 % 256 % 4294967296 else main_#t~mem75#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem75#1; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-4: assume !(main_~cpu1Writes_issued~0#1 < main_#t~mem74#1);havoc main_#t~mem74#1;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-4: assume !!(main_~cpu1Writes_issued~0#1 < main_#t~mem74#1);havoc main_#t~mem74#1; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-5: assume !(main_~cpu1Reads_issued~0#1 < main_#t~mem85#1);havoc main_#t~mem85#1;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-5: assume !!(main_~cpu1Reads_issued~0#1 < main_#t~mem85#1);havoc main_#t~mem85#1; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-6: assume true;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-6: assume !true; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-7: assume 3 == main_#t~mem84#1;havoc main_#t~mem84#1;call main_#t~mem85#1 := read~int#3(main_~#litmus_input~0#1.base, 244 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-7: assume !(3 == main_#t~mem84#1);havoc main_#t~mem84#1; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-8: assume 2 == main_#t~mem73#1;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int#3(main_~#litmus_input~0#1.base, 240 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-8: assume !(2 == main_#t~mem73#1);havoc main_#t~mem73#1;call main_#t~mem84#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-9: assume 1 == main_#t~mem62#1;havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int#3(main_~#litmus_input~0#1.base, 240 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-9: assume !(1 == main_#t~mem62#1);havoc main_#t~mem62#1;call main_#t~mem73#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-10: assume true;assume false; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-10: assume !true; [2025-02-07 17:29:47,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-11: assume 1 == (if main_#t~mem61#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem61#1 % 256 % 4294967296 else main_#t~mem61#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-11: assume !(1 == (if main_#t~mem61#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem61#1 % 256 % 4294967296 else main_#t~mem61#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem61#1; [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-12: assume main_#t~switch14#1;call main_#t~mem55#1 := read~int#3(main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem56#1 := read~int#3(main_~#litmus_input~0#1.base, 124 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1, 4);call main_#t~mem57#1 := read~int#3(main_~#litmus_input~0#1.base, 4 + (124 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem58#1 := read~int#3(main_~#litmus_input~0#1.base, 5 + (124 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem59#1 := read~int#3(main_~#litmus_input~0#1.base, 6 + (124 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem60#1 := read~int#3(main_~#litmus_input~0#1.base, 7 + (124 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call write~int#7(main_#t~mem56#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#7(main_#t~mem57#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem58#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem59#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem60#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem61#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L152-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 5 == main_#t~ret13#1; [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_#t~mem86#1;havoc main_#t~mem87#1;havoc main_#t~mem88#1;havoc main_#t~mem89#1;havoc main_#t~mem90#1;call main_#t~mem91#1 := read~int#3(main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);main_#t~post92#1 := main_#t~mem91#1;call write~int#3(1 + main_#t~post92#1, main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem91#1;havoc main_#t~post92#1;main_#t~post93#1 := main_~cpu1Reads_issued~0#1;main_~cpu1Reads_issued~0#1 := 1 + main_#t~post93#1;havoc main_#t~post93#1; [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169-1: SUMMARY for call tso_core_read(main_#t~mem86#1, main_#t~mem87#1, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169-2: call main_#t~mem86#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem87#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem88#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem89#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem90#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: call main_#t~mem144#1 := read~int#1(main_~#wrBuffer3~0#1.base, 16 + main_~#wrBuffer3~0#1.offset, 1); [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc main_#t~mem145#1;havoc main_#t~mem146#1;havoc main_#t~mem147#1;havoc main_#t~mem148#1;havoc main_#t~mem149#1;call main_#t~mem150#1 := read~int#3(main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);main_#t~post151#1 := main_#t~mem150#1;call write~int#3(1 + main_#t~post151#1, main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem150#1;havoc main_#t~post151#1;main_#t~post152#1 := main_~cpu3Writes_issued~0#1;main_~cpu3Writes_issued~0#1 := 1 + main_#t~post152#1;havoc main_#t~post152#1; [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L220-1: SUMMARY for call tso_core_write(main_#t~mem145#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem149#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset); srcloc: null [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L220-2: call main_#t~mem145#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem146#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem147#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem148#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem149#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-1: assume !((if main_#t~mem24#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem24#1 % 256 % 4294967296 else main_#t~mem24#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem24#1;assume false; [2025-02-07 17:29:47,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-1: assume !!((if main_#t~mem24#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem24#1 % 256 % 4294967296 else main_#t~mem24#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem24#1; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-2: assume !(main_~cpu0Writes_issued~0#1 < main_#t~mem23#1);havoc main_#t~mem23#1;assume false; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-2: assume !!(main_~cpu0Writes_issued~0#1 < main_#t~mem23#1);havoc main_#t~mem23#1; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-3: assume !(0 == (if main_#t~mem35#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem35#1 % 256 % 4294967296 else main_#t~mem35#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem35#1;assume false; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-3: assume !!(0 == (if main_#t~mem35#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem35#1 % 256 % 4294967296 else main_#t~mem35#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem35#1; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume !(main_~cpu0Writes_issued~0#1 < main_#t~mem34#1);havoc main_#t~mem34#1;assume false; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume !!(main_~cpu0Writes_issued~0#1 < main_#t~mem34#1);havoc main_#t~mem34#1; [2025-02-07 17:29:47,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: assume !(main_~cpu0Reads_issued~0#1 < main_#t~mem45#1);havoc main_#t~mem45#1;assume false; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: assume !!(main_~cpu0Reads_issued~0#1 < main_#t~mem45#1);havoc main_#t~mem45#1; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: assume true;assume false; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: assume !true; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: assume 3 == main_#t~mem44#1;havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int#3(main_~#litmus_input~0#1.base, 120 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: assume !(3 == main_#t~mem44#1);havoc main_#t~mem44#1; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume 2 == main_#t~mem33#1;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int#3(main_~#litmus_input~0#1.base, 116 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume !(2 == main_#t~mem33#1);havoc main_#t~mem33#1;call main_#t~mem44#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: assume 1 == main_#t~mem22#1;havoc main_#t~mem22#1;call main_#t~mem23#1 := read~int#3(main_~#litmus_input~0#1.base, 116 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: assume !(1 == main_#t~mem22#1);havoc main_#t~mem22#1;call main_#t~mem33#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume true;assume false; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume !true; [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: assume 0 == (if main_#t~mem21#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem21#1 % 256 % 4294967296 else main_#t~mem21#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem21#1;call main_#t~mem22#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: assume !(0 == (if main_#t~mem21#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem21#1 % 256 % 4294967296 else main_#t~mem21#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem21#1; [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-12: assume main_#t~switch14#1;call main_#t~mem15#1 := read~int#3(main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem16#1 := read~int#3(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1, 4);call main_#t~mem17#1 := read~int#3(main_~#litmus_input~0#1.base, 4 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem18#1 := read~int#3(main_~#litmus_input~0#1.base, 5 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem19#1 := read~int#3(main_~#litmus_input~0#1.base, 6 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem20#1 := read~int#3(main_~#litmus_input~0#1.base, 7 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call write~int#7(main_#t~mem16#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#7(main_#t~mem17#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem18#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem19#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem20#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem21#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 4 == main_#t~ret13#1; [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc main_#t~mem46#1;havoc main_#t~mem47#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~mem50#1;call main_#t~mem51#1 := read~int#3(main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);main_#t~post52#1 := main_#t~mem51#1;call write~int#3(1 + main_#t~post52#1, main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~post52#1;main_#t~post53#1 := main_~cpu0Reads_issued~0#1;main_~cpu0Reads_issued~0#1 := 1 + main_#t~post53#1;havoc main_#t~post53#1; [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138-1: SUMMARY for call tso_core_read(main_#t~mem46#1, main_#t~mem47#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138-2: call main_#t~mem46#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem47#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem48#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem49#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem50#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: call main_#t~mem104#1 := read~int#1(main_~#wrBuffer2~0#1.base, 16 + main_~#wrBuffer2~0#1.offset, 1); [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc main_#t~mem105#1;havoc main_#t~mem106#1;havoc main_#t~mem107#1;havoc main_#t~mem108#1;havoc main_#t~mem109#1;call main_#t~mem110#1 := read~int#3(main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);main_#t~post111#1 := main_#t~mem110#1;call write~int#3(1 + main_#t~post111#1, main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem110#1;havoc main_#t~post111#1;main_#t~post112#1 := main_~cpu2Writes_issued~0#1;main_~cpu2Writes_issued~0#1 := 1 + main_#t~post112#1;havoc main_#t~post112#1; [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189-1: SUMMARY for call tso_core_write(main_#t~mem105#1, main_#t~mem106#1, main_#t~mem107#1, main_#t~mem108#1, main_#t~mem109#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset); srcloc: null [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189-2: call main_#t~mem105#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem106#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem107#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem108#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem109#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: call main_#t~mem64#1 := read~int#1(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_#t~mem65#1;havoc main_#t~mem66#1;havoc main_#t~mem67#1;havoc main_#t~mem68#1;havoc main_#t~mem69#1;call main_#t~mem70#1 := read~int#3(main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);main_#t~post71#1 := main_#t~mem70#1;call write~int#3(1 + main_#t~post71#1, main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem70#1;havoc main_#t~post71#1;main_#t~post72#1 := main_~cpu1Writes_issued~0#1;main_~cpu1Writes_issued~0#1 := 1 + main_#t~post72#1;havoc main_#t~post72#1; [2025-02-07 17:29:47,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L158-1: SUMMARY for call tso_core_write(main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset); srcloc: null [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L158-2: call main_#t~mem65#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem66#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem67#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem68#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem69#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc __VERIFIER_nondet_step_#t~nondet0#1;main_#t~ret13#1 := __VERIFIER_nondet_step_#res#1;havoc __VERIFIER_nondet_step_#t~nondet0#1;assume { :end_inline___VERIFIER_nondet_step } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_#t~switch14#1 := 0 == main_#t~ret13#1; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L241-1: assume !((if main_#t~mem174#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem174#1 % 256 % 4294967296 else main_#t~mem174#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem174#1;assume false; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L241-1: assume !!((if main_#t~mem174#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem174#1 % 256 % 4294967296 else main_#t~mem174#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem174#1; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L241-2: assume main_#t~switch14#1;call main_#t~mem174#1 := read~int#1(main_~#wrBuffer3~0#1.base, 16 + main_~#wrBuffer3~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L241-2: assume !main_#t~switch14#1;main_#t~switch14#1 := true; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: call main_#t~mem155#1 := read~int#1(main_~#wrBuffer3~0#1.base, 16 + main_~#wrBuffer3~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: call main_#t~mem24#1 := read~int#1(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: havoc main_#t~mem156#1;havoc main_#t~mem157#1;havoc main_#t~mem158#1;havoc main_#t~mem159#1;havoc main_#t~mem160#1;call main_#t~mem161#1 := read~int#3(main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);main_#t~post162#1 := main_#t~mem161#1;call write~int#3(1 + main_#t~post162#1, main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem161#1;havoc main_#t~post162#1;main_#t~post163#1 := main_~cpu3Writes_issued~0#1;main_~cpu3Writes_issued~0#1 := 1 + main_#t~post163#1;havoc main_#t~post163#1; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L226-1: SUMMARY for call tso_core_fence(main_#t~mem156#1, main_#t~mem157#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~mem160#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L226-2: call main_#t~mem156#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem157#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem158#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem159#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem160#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc main_#t~mem25#1;havoc main_#t~mem26#1;havoc main_#t~mem27#1;havoc main_#t~mem28#1;havoc main_#t~mem29#1;call main_#t~mem30#1 := read~int#3(main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);main_#t~post31#1 := main_#t~mem30#1;call write~int#3(1 + main_#t~post31#1, main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem30#1;havoc main_#t~post31#1;main_#t~post32#1 := main_~cpu0Writes_issued~0#1;main_~cpu0Writes_issued~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L127-1: SUMMARY for call tso_core_write(main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset); srcloc: null [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L127-2: call main_#t~mem25#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem26#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem27#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem28#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem29#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L243: SUMMARY for call stepWriteBuffer(main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L210-1: assume !((if main_#t~mem134#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem134#1 % 256 % 4294967296 else main_#t~mem134#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem134#1;assume false; [2025-02-07 17:29:47,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L210-1: assume !!((if main_#t~mem134#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem134#1 % 256 % 4294967296 else main_#t~mem134#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem134#1; [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L210-2: assume main_#t~switch14#1;call main_#t~mem134#1 := read~int#1(main_~#wrBuffer2~0#1.base, 16 + main_~#wrBuffer2~0#1.offset, 1); [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L210-2: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 3 == main_#t~ret13#1; [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: call main_#t~mem115#1 := read~int#1(main_~#wrBuffer2~0#1.base, 16 + main_~#wrBuffer2~0#1.offset, 1); [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset);havoc main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset);havoc main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L195: havoc main_#t~mem116#1;havoc main_#t~mem117#1;havoc main_#t~mem118#1;havoc main_#t~mem119#1;havoc main_#t~mem120#1;call main_#t~mem121#1 := read~int#3(main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);main_#t~post122#1 := main_#t~mem121#1;call write~int#3(1 + main_#t~post122#1, main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem121#1;havoc main_#t~post122#1;main_#t~post123#1 := main_~cpu2Writes_issued~0#1;main_~cpu2Writes_issued~0#1 := 1 + main_#t~post123#1;havoc main_#t~post123#1; [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-1: SUMMARY for call tso_core_fence(main_#t~mem116#1, main_#t~mem117#1, main_#t~mem118#1, main_#t~mem119#1, main_#t~mem120#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:47,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-2: call main_#t~mem116#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem117#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem118#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem119#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem120#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245-1: assume true;assume false; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245-1: assume !true; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: SUMMARY for call stepWriteBuffer(main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245-2: assume main_#t~switch14#1; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245-2: assume !main_#t~switch14#1;havoc main_#t~ret13#1;havoc main_#t~switch14#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~mem20#1;havoc main_#t~mem55#1;havoc main_#t~mem56#1;havoc main_#t~mem57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1;havoc main_#t~mem95#1;havoc main_#t~mem96#1;havoc main_#t~mem97#1;havoc main_#t~mem98#1;havoc main_#t~mem99#1;havoc main_#t~mem100#1;havoc main_#t~mem135#1;havoc main_#t~mem136#1;havoc main_#t~mem137#1;havoc main_#t~mem138#1;havoc main_#t~mem139#1;havoc main_#t~mem140#1;havoc main_#t~ret13#1;havoc main_#t~switch14#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~mem20#1;havoc main_#t~mem55#1;havoc main_#t~mem56#1;havoc main_#t~mem57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1;havoc main_#t~mem95#1;havoc main_#t~mem96#1;havoc main_#t~mem97#1;havoc main_#t~mem98#1;havoc main_#t~mem99#1;havoc main_#t~mem100#1;havoc main_#t~mem135#1;havoc main_#t~mem136#1;havoc main_#t~mem137#1;havoc main_#t~mem138#1;havoc main_#t~mem139#1;havoc main_#t~mem140#1; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L179-1: assume !((if main_#t~mem94#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem94#1 % 256 % 4294967296 else main_#t~mem94#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem94#1;assume false; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L179-1: assume !!((if main_#t~mem94#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem94#1 % 256 % 4294967296 else main_#t~mem94#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem94#1; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L179-2: assume main_#t~switch14#1;call main_#t~mem94#1 := read~int#1(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L179-2: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 2 == main_#t~ret13#1; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: call main_#t~mem75#1 := read~int#1(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: havoc main_#t~mem76#1;havoc main_#t~mem77#1;havoc main_#t~mem78#1;havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int#3(main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);main_#t~post82#1 := main_#t~mem81#1;call write~int#3(1 + main_#t~post82#1, main_~#litmus_input~0#1.base, 236 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem81#1;havoc main_#t~post82#1;main_#t~post83#1 := main_~cpu1Writes_issued~0#1;main_~cpu1Writes_issued~0#1 := 1 + main_#t~post83#1;havoc main_#t~post83#1; [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: SUMMARY for call tso_core_fence(main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:47,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-2: call main_#t~mem76#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem77#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem78#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem79#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem80#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-1: assume !((if main_#t~mem144#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem144#1 % 256 % 4294967296 else main_#t~mem144#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem144#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-1: assume !!((if main_#t~mem144#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem144#1 % 256 % 4294967296 else main_#t~mem144#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem144#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: SUMMARY for call stepWriteBuffer(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-2: assume !(main_~cpu3Writes_issued~0#1 < main_#t~mem143#1);havoc main_#t~mem143#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-2: assume !!(main_~cpu3Writes_issued~0#1 < main_#t~mem143#1);havoc main_#t~mem143#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-3: assume !(0 == (if main_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem155#1 % 256 % 4294967296 else main_#t~mem155#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem155#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-3: assume !!(0 == (if main_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem155#1 % 256 % 4294967296 else main_#t~mem155#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem155#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148-1: assume !((if main_#t~mem54#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem54#1 % 256 % 4294967296 else main_#t~mem54#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem54#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148-1: assume !!((if main_#t~mem54#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem54#1 % 256 % 4294967296 else main_#t~mem54#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem54#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-4: assume !(main_~cpu3Writes_issued~0#1 < main_#t~mem154#1);havoc main_#t~mem154#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-4: assume !!(main_~cpu3Writes_issued~0#1 < main_#t~mem154#1);havoc main_#t~mem154#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148-2: assume main_#t~switch14#1;call main_#t~mem54#1 := read~int#1(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L148-2: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 1 == main_#t~ret13#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-5: assume !(main_~cpu3Reads_issued~0#1 < main_#t~mem165#1);havoc main_#t~mem165#1;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-5: assume !!(main_~cpu3Reads_issued~0#1 < main_#t~mem165#1);havoc main_#t~mem165#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-6: assume true;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-6: assume !true; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-7: assume 3 == main_#t~mem164#1;havoc main_#t~mem164#1;call main_#t~mem165#1 := read~int#3(main_~#litmus_input~0#1.base, 492 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-7: assume !(3 == main_#t~mem164#1);havoc main_#t~mem164#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-8: assume 2 == main_#t~mem153#1;havoc main_#t~mem153#1;call main_#t~mem154#1 := read~int#3(main_~#litmus_input~0#1.base, 488 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-8: assume !(2 == main_#t~mem153#1);havoc main_#t~mem153#1;call main_#t~mem164#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-9: assume 1 == main_#t~mem142#1;havoc main_#t~mem142#1;call main_#t~mem143#1 := read~int#3(main_~#litmus_input~0#1.base, 488 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-9: assume !(1 == main_#t~mem142#1);havoc main_#t~mem142#1;call main_#t~mem153#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-10: assume true;assume false; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-10: assume !true; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-11: assume 3 == (if main_#t~mem141#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem141#1 % 256 % 4294967296 else main_#t~mem141#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem141#1;call main_#t~mem142#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-11: assume !(3 == (if main_#t~mem141#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem141#1 % 256 % 4294967296 else main_#t~mem141#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem141#1; [2025-02-07 17:29:47,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-12: assume main_#t~switch14#1;call main_#t~mem135#1 := read~int#3(main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem136#1 := read~int#3(main_~#litmus_input~0#1.base, 372 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem135#1, 4);call main_#t~mem137#1 := read~int#3(main_~#litmus_input~0#1.base, 4 + (372 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem135#1), 1);call main_#t~mem138#1 := read~int#3(main_~#litmus_input~0#1.base, 5 + (372 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem135#1), 1);call main_#t~mem139#1 := read~int#3(main_~#litmus_input~0#1.base, 6 + (372 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem135#1), 1);call main_#t~mem140#1 := read~int#3(main_~#litmus_input~0#1.base, 7 + (372 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem135#1), 1);call write~int#7(main_#t~mem136#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#7(main_#t~mem137#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem138#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem139#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem140#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem141#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 7 == main_#t~ret13#1; [2025-02-07 17:29:47,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_#t~mem166#1;havoc main_#t~mem167#1;havoc main_#t~mem168#1;havoc main_#t~mem169#1;havoc main_#t~mem170#1;call main_#t~mem171#1 := read~int#3(main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);main_#t~post172#1 := main_#t~mem171#1;call write~int#3(1 + main_#t~post172#1, main_~#litmus_input~0#1.base, 484 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem171#1;havoc main_#t~post172#1;main_#t~post173#1 := main_~cpu3Reads_issued~0#1;main_~cpu3Reads_issued~0#1 := 1 + main_#t~post173#1;havoc main_#t~post173#1; [2025-02-07 17:29:47,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L231-1: SUMMARY for call tso_core_read(main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L231-2: call main_#t~mem166#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem167#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem168#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem169#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem170#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: call main_#t~mem35#1 := read~int#1(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_#t~mem36#1;havoc main_#t~mem37#1;havoc main_#t~mem38#1;havoc main_#t~mem39#1;havoc main_#t~mem40#1;call main_#t~mem41#1 := read~int#3(main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int#3(1 + main_#t~post42#1, main_~#litmus_input~0#1.base, 112 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1;main_#t~post43#1 := main_~cpu0Writes_issued~0#1;main_~cpu0Writes_issued~0#1 := 1 + main_#t~post43#1;havoc main_#t~post43#1; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-1: SUMMARY for call tso_core_fence(main_#t~mem36#1, main_#t~mem37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~mem40#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-2: call main_#t~mem36#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem37#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem38#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem39#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem40#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-1: assume !((if main_#t~mem104#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem104#1 % 256 % 4294967296 else main_#t~mem104#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem104#1;assume false; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-1: assume !!((if main_#t~mem104#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem104#1 % 256 % 4294967296 else main_#t~mem104#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem104#1; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: SUMMARY for call stepWriteBuffer(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-2: assume !(main_~cpu2Writes_issued~0#1 < main_#t~mem103#1);havoc main_#t~mem103#1;assume false; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-2: assume !!(main_~cpu2Writes_issued~0#1 < main_#t~mem103#1);havoc main_#t~mem103#1; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-3: assume !(0 == (if main_#t~mem115#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem115#1 % 256 % 4294967296 else main_#t~mem115#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem115#1;assume false; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-3: assume !!(0 == (if main_#t~mem115#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem115#1 % 256 % 4294967296 else main_#t~mem115#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem115#1; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-4: assume !(main_~cpu2Writes_issued~0#1 < main_#t~mem114#1);havoc main_#t~mem114#1;assume false; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-4: assume !!(main_~cpu2Writes_issued~0#1 < main_#t~mem114#1);havoc main_#t~mem114#1; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-5: assume !(main_~cpu2Reads_issued~0#1 < main_#t~mem125#1);havoc main_#t~mem125#1;assume false; [2025-02-07 17:29:47,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-5: assume !!(main_~cpu2Reads_issued~0#1 < main_#t~mem125#1);havoc main_#t~mem125#1; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-6: assume true;assume false; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-6: assume !true; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-7: assume 3 == main_#t~mem124#1;havoc main_#t~mem124#1;call main_#t~mem125#1 := read~int#3(main_~#litmus_input~0#1.base, 368 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-7: assume !(3 == main_#t~mem124#1);havoc main_#t~mem124#1; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-8: assume 2 == main_#t~mem113#1;havoc main_#t~mem113#1;call main_#t~mem114#1 := read~int#3(main_~#litmus_input~0#1.base, 364 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-8: assume !(2 == main_#t~mem113#1);havoc main_#t~mem113#1;call main_#t~mem124#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-9: assume 1 == main_#t~mem102#1;havoc main_#t~mem102#1;call main_#t~mem103#1 := read~int#3(main_~#litmus_input~0#1.base, 364 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-9: assume !(1 == main_#t~mem102#1);havoc main_#t~mem102#1;call main_#t~mem113#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-10: assume true;assume false; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-10: assume !true; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-11: assume 2 == (if main_#t~mem101#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem101#1 % 256 % 4294967296 else main_#t~mem101#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem101#1;call main_#t~mem102#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-11: assume !(2 == (if main_#t~mem101#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem101#1 % 256 % 4294967296 else main_#t~mem101#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem101#1; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-12: assume main_#t~switch14#1;call main_#t~mem95#1 := read~int#3(main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem96#1 := read~int#3(main_~#litmus_input~0#1.base, 248 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem95#1, 4);call main_#t~mem97#1 := read~int#3(main_~#litmus_input~0#1.base, 4 + (248 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem95#1), 1);call main_#t~mem98#1 := read~int#3(main_~#litmus_input~0#1.base, 5 + (248 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem95#1), 1);call main_#t~mem99#1 := read~int#3(main_~#litmus_input~0#1.base, 6 + (248 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem95#1), 1);call main_#t~mem100#1 := read~int#3(main_~#litmus_input~0#1.base, 7 + (248 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem95#1), 1);call write~int#7(main_#t~mem96#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#7(main_#t~mem97#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem98#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem99#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#7(main_#t~mem100#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem101#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 6 == main_#t~ret13#1; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc main_#t~mem126#1;havoc main_#t~mem127#1;havoc main_#t~mem128#1;havoc main_#t~mem129#1;havoc main_#t~mem130#1;call main_#t~mem131#1 := read~int#3(main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);main_#t~post132#1 := main_#t~mem131#1;call write~int#3(1 + main_#t~post132#1, main_~#litmus_input~0#1.base, 360 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem131#1;havoc main_#t~post132#1;main_#t~post133#1 := main_~cpu2Reads_issued~0#1;main_~cpu2Reads_issued~0#1 := 1 + main_#t~post133#1;havoc main_#t~post133#1; [2025-02-07 17:29:47,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L200-1: SUMMARY for call tso_core_read(main_#t~mem126#1, main_#t~mem127#1, main_#t~mem128#1, main_#t~mem129#1, main_#t~mem130#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:47,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L200-2: call main_#t~mem126#1 := read~int#7(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem127#1 := read~int#7(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem128#1 := read~int#7(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem129#1 := read~int#7(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem130#1 := read~int#7(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:47,394 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2025-02-07 17:29:47,394 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:29:47,405 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:29:47,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:29:47,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:47 BoogieIcfgContainer [2025-02-07 17:29:47,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:29:47,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:29:47,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:29:47,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:29:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:29:45" (1/3) ... [2025-02-07 17:29:47,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd4e20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:29:47, skipping insertion in model container [2025-02-07 17:29:47,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:45" (2/3) ... [2025-02-07 17:29:47,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd4e20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:29:47, skipping insertion in model container [2025-02-07 17:29:47,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:47" (3/3) ... [2025-02-07 17:29:47,419 INFO L128 eAbstractionObserver]: Analyzing ICFG 4SB.i [2025-02-07 17:29:47,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:29:47,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 4SB.i that has 8 procedures, 159 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-02-07 17:29:47,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:29:47,477 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;@1c6c8a7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:29:47,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:29:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 120 states have (on average 1.5916666666666666) internal successors, (191), 123 states have internal predecessors, (191), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:29:47,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:47,489 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:47,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:47,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1068340987, now seen corresponding path program 1 times [2025-02-07 17:29:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510833196] [2025-02-07 17:29:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:47,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 17:29:47,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:29:47,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:47,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-07 17:29:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510833196] [2025-02-07 17:29:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510833196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:29:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:29:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069860208] [2025-02-07 17:29:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:48,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:48,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:48,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:29:48,103 INFO L87 Difference]: Start difference. First operand has 137 states, 120 states have (on average 1.5916666666666666) internal successors, (191), 123 states have internal predecessors, (191), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:48,133 INFO L93 Difference]: Finished difference Result 273 states and 421 transitions. [2025-02-07 17:29:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2025-02-07 17:29:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:48,139 INFO L225 Difference]: With dead ends: 273 [2025-02-07 17:29:48,139 INFO L226 Difference]: Without dead ends: 132 [2025-02-07 17:29:48,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:29:48,144 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:48,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-07 17:29:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-07 17:29:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2025-02-07 17:29:48,182 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 60 [2025-02-07 17:29:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:48,183 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2025-02-07 17:29:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2025-02-07 17:29:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 17:29:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:48,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:48,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:29:48,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash -140681200, now seen corresponding path program 1 times [2025-02-07 17:29:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015641336] [2025-02-07 17:29:48,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:48,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 17:29:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 17:29:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-07 17:29:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015641336] [2025-02-07 17:29:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015641336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444398799] [2025-02-07 17:29:48,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:48,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:48,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:48,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:29:48,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 17:29:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 17:29:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:48,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:48,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 17:29:48,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444398799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479627027] [2025-02-07 17:29:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:48,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:48,912 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:48,927 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2025-02-07 17:29:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-02-07 17:29:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:48,928 INFO L225 Difference]: With dead ends: 261 [2025-02-07 17:29:48,928 INFO L226 Difference]: Without dead ends: 133 [2025-02-07 17:29:48,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:48,929 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:48,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-07 17:29:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-07 17:29:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 119 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2025-02-07 17:29:48,936 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 62 [2025-02-07 17:29:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2025-02-07 17:29:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2025-02-07 17:29:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-07 17:29:48,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:48,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:48,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:29:49,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:49,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1035628980, now seen corresponding path program 1 times [2025-02-07 17:29:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897600621] [2025-02-07 17:29:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:49,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-07 17:29:49,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 17:29:49,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:49,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-07 17:29:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897600621] [2025-02-07 17:29:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897600621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489285203] [2025-02-07 17:29:49,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:49,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:49,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:49,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:49,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:29:49,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-07 17:29:49,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 17:29:49,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:49,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-07 17:29:49,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489285203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672200136] [2025-02-07 17:29:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:49,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:49,825 INFO L87 Difference]: Start difference. First operand 133 states and 181 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:49,848 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2025-02-07 17:29:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-02-07 17:29:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:49,850 INFO L225 Difference]: With dead ends: 251 [2025-02-07 17:29:49,850 INFO L226 Difference]: Without dead ends: 140 [2025-02-07 17:29:49,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:49,851 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 6 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:49,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-07 17:29:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-02-07 17:29:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.35) internal successors, (162), 120 states have internal predecessors, (162), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2025-02-07 17:29:49,858 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 66 [2025-02-07 17:29:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:49,858 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2025-02-07 17:29:49,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2025-02-07 17:29:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:29:49,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:49,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:49,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:29:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:50,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash 16544053, now seen corresponding path program 1 times [2025-02-07 17:29:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953312213] [2025-02-07 17:29:50,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:50,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:29:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:29:50,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:50,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:29:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953312213] [2025-02-07 17:29:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953312213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456085035] [2025-02-07 17:29:50,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:50,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:50,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:50,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:50,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:29:50,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:29:50,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:29:50,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:50,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:50,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-07 17:29:50,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:50,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456085035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:50,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:50,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:50,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766473861] [2025-02-07 17:29:50,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:50,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:50,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:50,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:50,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:50,649 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:50,674 INFO L93 Difference]: Finished difference Result 245 states and 332 transitions. [2025-02-07 17:29:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:50,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-02-07 17:29:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:50,676 INFO L225 Difference]: With dead ends: 245 [2025-02-07 17:29:50,676 INFO L226 Difference]: Without dead ends: 141 [2025-02-07 17:29:50,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:50,677 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:50,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 344 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-07 17:29:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2025-02-07 17:29:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2025-02-07 17:29:50,695 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 69 [2025-02-07 17:29:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:50,695 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2025-02-07 17:29:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2025-02-07 17:29:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 17:29:50,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:50,696 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:50,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:29:50,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:50,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1306499110, now seen corresponding path program 1 times [2025-02-07 17:29:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293878960] [2025-02-07 17:29:50,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:51,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 17:29:51,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 17:29:51,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:51,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-07 17:29:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293878960] [2025-02-07 17:29:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293878960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107361100] [2025-02-07 17:29:51,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:51,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:51,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:29:51,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 17:29:51,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 17:29:51,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:51,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:51,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-07 17:29:51,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107361100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825542850] [2025-02-07 17:29:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:51,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:51,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:51,524 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:51,550 INFO L93 Difference]: Finished difference Result 239 states and 323 transitions. [2025-02-07 17:29:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-02-07 17:29:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:51,552 INFO L225 Difference]: With dead ends: 239 [2025-02-07 17:29:51,552 INFO L226 Difference]: Without dead ends: 142 [2025-02-07 17:29:51,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:51,553 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:51,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 348 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-07 17:29:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2025-02-07 17:29:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2025-02-07 17:29:51,565 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 72 [2025-02-07 17:29:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:51,566 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2025-02-07 17:29:51,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2025-02-07 17:29:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 17:29:51,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:51,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:51,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:29:51,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:51,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1126553125, now seen corresponding path program 1 times [2025-02-07 17:29:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906575417] [2025-02-07 17:29:51,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:51,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:29:51,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:29:51,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:51,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-07 17:29:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906575417] [2025-02-07 17:29:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906575417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499132204] [2025-02-07 17:29:51,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:51,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:51,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:29:52,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:29:52,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:29:52,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:52,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:52,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:52,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 17:29:52,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499132204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:52,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708418742] [2025-02-07 17:29:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:52,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:52,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:52,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:52,349 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:52,376 INFO L93 Difference]: Finished difference Result 229 states and 311 transitions. [2025-02-07 17:29:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2025-02-07 17:29:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:52,378 INFO L225 Difference]: With dead ends: 229 [2025-02-07 17:29:52,379 INFO L226 Difference]: Without dead ends: 143 [2025-02-07 17:29:52,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:52,380 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 6 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:52,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-07 17:29:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2025-02-07 17:29:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 123 states have (on average 1.3414634146341464) internal successors, (165), 123 states have internal predecessors, (165), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 185 transitions. [2025-02-07 17:29:52,393 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 185 transitions. Word has length 75 [2025-02-07 17:29:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:52,393 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 185 transitions. [2025-02-07 17:29:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 17:29:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 185 transitions. [2025-02-07 17:29:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 17:29:52,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:52,394 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:52,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:29:52,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:52,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:52,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1905724160, now seen corresponding path program 1 times [2025-02-07 17:29:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814630089] [2025-02-07 17:29:52,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:52,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 17:29:52,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 17:29:52,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:52,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-07 17:29:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814630089] [2025-02-07 17:29:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814630089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324508551] [2025-02-07 17:29:52,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:52,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:52,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:52,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:29:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 17:29:53,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 17:29:53,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:53,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:53,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:53,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 17:29:53,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:53,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324508551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:53,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:53,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071614901] [2025-02-07 17:29:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:53,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:53,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:53,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:53,151 INFO L87 Difference]: Start difference. First operand 137 states and 185 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:53,227 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2025-02-07 17:29:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 78 [2025-02-07 17:29:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:53,228 INFO L225 Difference]: With dead ends: 203 [2025-02-07 17:29:53,228 INFO L226 Difference]: Without dead ends: 194 [2025-02-07 17:29:53,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:53,229 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 84 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:53,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 282 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:29:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-07 17:29:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2025-02-07 17:29:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 17:29:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 186 transitions. [2025-02-07 17:29:53,234 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 186 transitions. Word has length 78 [2025-02-07 17:29:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:53,234 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 186 transitions. [2025-02-07 17:29:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 186 transitions. [2025-02-07 17:29:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-07 17:29:53,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:53,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:53,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 17:29:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-07 17:29:53,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:53,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1287418540, now seen corresponding path program 1 times [2025-02-07 17:29:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287339040] [2025-02-07 17:29:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:53,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-07 17:29:53,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-07 17:29:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 17:29:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287339040] [2025-02-07 17:29:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287339040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079165585] [2025-02-07 17:29:53,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:53,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:53,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:29:54,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-07 17:29:54,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-07 17:29:54,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:54,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:54,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:29:54,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-07 17:29:54,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079165585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894928111] [2025-02-07 17:29:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:54,174 INFO L87 Difference]: Start difference. First operand 138 states and 186 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:54,179 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2025-02-07 17:29:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 135 [2025-02-07 17:29:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:54,180 INFO L225 Difference]: With dead ends: 138 [2025-02-07 17:29:54,180 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 17:29:54,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:54,181 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 28 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:54,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 248 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 17:29:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 17:29:54,182 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 17:29:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 17:29:54,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2025-02-07 17:29:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 17:29:54,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 17:29:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 17:29:54,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 17:29:54,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 17:29:54,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 17:29:54,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:54,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:54,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 17:29:54,408 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 17:29:54,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 05:29:54 BoogieIcfgContainer [2025-02-07 17:29:54,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 17:29:54,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 17:29:54,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 17:29:54,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 17:29:54,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:47" (3/4) ... [2025-02-07 17:29:54,420 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 17:29:54,423 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure store_buffering_4_conditions [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_write [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure stepWriteBuffer [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_read [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_fence [2025-02-07 17:29:54,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure initWriteBuffer [2025-02-07 17:29:54,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2025-02-07 17:29:54,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-07 17:29:54,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 17:29:54,435 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 17:29:54,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 17:29:54,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 17:29:54,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 17:29:54,520 INFO L158 Benchmark]: Toolchain (without parser) took 9426.98ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 129.3MB in the beginning and 241.2MB in the end (delta: -111.8MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.16ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 101.4MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.21ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 92.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: Boogie Preprocessor took 107.17ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 80.4MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: IcfgBuilder took 1744.21ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 62.5MB in the end (delta: 18.0MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,520 INFO L158 Benchmark]: TraceAbstraction took 7007.57ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 61.9MB in the beginning and 257.5MB in the end (delta: -195.6MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,521 INFO L158 Benchmark]: Witness Printer took 101.45ms. Allocated memory is still 427.8MB. Free memory was 257.5MB in the beginning and 241.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 17:29:54,522 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.16ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 101.4MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.21ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 92.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.17ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 80.4MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1744.21ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 62.5MB in the end (delta: 18.0MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7007.57ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 61.9MB in the beginning and 257.5MB in the end (delta: -195.6MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 101.45ms. Allocated memory is still 427.8MB. Free memory was 257.5MB in the beginning and 241.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. 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: 556]: 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 8 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 2672 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1281 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1391 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5098 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 706/713 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 1 specifications checked. All of them hold - InvariantResult [Line: 464]: Location Invariant Derived location invariant: (((long long) event_i0 + 1) == 0) RESULT: Ultimate proved your program to be correct! [2025-02-07 17:29:54,535 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