./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/pthread-wmm/mix033_tso.oepc.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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:21:11,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:21:12,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:21:12,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:21:12,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:21:12,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:21:12,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:21:12,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:21:12,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:21:12,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:21:12,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:21:12,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:21:12,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:21:12,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:21:12,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:21:12,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:21:12,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:21:12,085 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2025-02-06 04:21:12,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:21:12,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:21:12,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:21:12,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:21:12,332 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:21:12,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2025-02-06 04:21:13,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1046b9705/215637ae83654c508725a79c7d61a84d/FLAGd67791064 [2025-02-06 04:21:13,755 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:21:13,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2025-02-06 04:21:13,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1046b9705/215637ae83654c508725a79c7d61a84d/FLAGd67791064 [2025-02-06 04:21:14,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1046b9705/215637ae83654c508725a79c7d61a84d [2025-02-06 04:21:14,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:21:14,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:21:14,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:21:14,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:21:14,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:21:14,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e25f51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14, skipping insertion in model container [2025-02-06 04:21:14,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:21:14,167 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/pthread-wmm/mix033_tso.oepc.i[949,962] [2025-02-06 04:21:14,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:21:14,351 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:21:14,360 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/pthread-wmm/mix033_tso.oepc.i[949,962] [2025-02-06 04:21:14,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:21:14,450 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:21:14,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14 WrapperNode [2025-02-06 04:21:14,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:21:14,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:21:14,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:21:14,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:21:14,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,493 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2025-02-06 04:21:14,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:21:14,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:21:14,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:21:14,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:21:14,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:21:14,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:21:14,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:21:14,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:21:14,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:21:14,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (1/1) ... [2025-02-06 04:21:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:21:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:21:14,552 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-06 04:21:14,556 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-06 04:21:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:21:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:21:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:21:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:21:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:21:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:21:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:21:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:21:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:21:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:21:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:21:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:21:14,574 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:21:14,673 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:21:14,675 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:21:14,930 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:21:14,931 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:21:15,089 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:21:15,089 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:21:15,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:21:15 BoogieIcfgContainer [2025-02-06 04:21:15,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:21:15,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:21:15,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:21:15,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:21:15,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:21:14" (1/3) ... [2025-02-06 04:21:15,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d99653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:21:15, skipping insertion in model container [2025-02-06 04:21:15,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:21:14" (2/3) ... [2025-02-06 04:21:15,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d99653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:21:15, skipping insertion in model container [2025-02-06 04:21:15,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:21:15" (3/3) ... [2025-02-06 04:21:15,100 INFO L128 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2025-02-06 04:21:15,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:21:15,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix033_tso.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 04:21:15,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:21:15,177 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:21:15,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2025-02-06 04:21:15,236 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2025-02-06 04:21:15,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:21:15,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-06 04:21:15,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2025-02-06 04:21:15,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2025-02-06 04:21:15,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:21:15,268 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;@3c80d4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:21:15,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:21:15,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:21:15,274 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 04:21:15,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:21:15,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:15,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 04:21:15,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:15,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1774854480, now seen corresponding path program 1 times [2025-02-06 04:21:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601239095] [2025-02-06 04:21:15,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:15,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:21:15,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:21:15,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:15,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601239095] [2025-02-06 04:21:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601239095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 04:21:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202614199] [2025-02-06 04:21:15,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:21:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:15,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:21:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:21:15,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 04:21:15,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-06 04:21:15,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:15,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 04:21:15,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:16,808 INFO L124 PetriNetUnfolderBase]: 7727/11005 cut-off events. [2025-02-06 04:21:16,809 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 04:21:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22028 conditions, 11005 events. 7727/11005 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 61817 event pairs, 629 based on Foata normal form. 378/11341 useless extension candidates. Maximal degree in co-relation 22017. Up to 9871 conditions per place. [2025-02-06 04:21:16,863 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 49 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2025-02-06 04:21:16,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 236 flow [2025-02-06 04:21:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:21:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:21:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-02-06 04:21:16,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-06 04:21:16,876 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 83 transitions. [2025-02-06 04:21:16,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 236 flow [2025-02-06 04:21:16,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:21:16,883 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-02-06 04:21:16,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-06 04:21:16,889 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-02-06 04:21:16,890 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-02-06 04:21:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-06 04:21:16,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:16,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:16,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:21:16,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1983010472, now seen corresponding path program 1 times [2025-02-06 04:21:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633649646] [2025-02-06 04:21:16,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:16,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:16,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:21:16,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:21:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:16,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:17,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633649646] [2025-02-06 04:21:17,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633649646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:17,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:17,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:21:17,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084956481] [2025-02-06 04:21:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:17,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:21:17,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:17,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:21:17,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:21:17,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-02-06 04:21:17,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-06 04:21:17,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:17,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-02-06 04:21:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:18,674 INFO L124 PetriNetUnfolderBase]: 9895/14287 cut-off events. [2025-02-06 04:21:18,674 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-02-06 04:21:18,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28953 conditions, 14287 events. 9895/14287 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 80005 event pairs, 2317 based on Foata normal form. 0/14032 useless extension candidates. Maximal degree in co-relation 28943. Up to 6737 conditions per place. [2025-02-06 04:21:18,742 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 46 selfloop transitions, 2 changer transitions 84/136 dead transitions. [2025-02-06 04:21:18,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 136 transitions, 558 flow [2025-02-06 04:21:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:21:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:21:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-02-06 04:21:18,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523255813953488 [2025-02-06 04:21:18,744 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 8 states and 190 transitions. [2025-02-06 04:21:18,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 136 transitions, 558 flow [2025-02-06 04:21:18,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 136 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:21:18,750 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 94 flow [2025-02-06 04:21:18,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2025-02-06 04:21:18,751 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-02-06 04:21:18,751 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 94 flow [2025-02-06 04:21:18,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-06 04:21:18,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:18,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:21:18,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:18,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1648560026, now seen corresponding path program 1 times [2025-02-06 04:21:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905308984] [2025-02-06 04:21:18,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:21:18,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:21:18,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905308984] [2025-02-06 04:21:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905308984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:21:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382499022] [2025-02-06 04:21:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:21:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:19,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:21:19,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:21:19,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-02-06 04:21:19,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-06 04:21:19,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:19,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-02-06 04:21:19,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:19,996 INFO L124 PetriNetUnfolderBase]: 6900/10020 cut-off events. [2025-02-06 04:21:19,996 INFO L125 PetriNetUnfolderBase]: For 1770/1770 co-relation queries the response was YES. [2025-02-06 04:21:20,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21798 conditions, 10020 events. 6900/10020 cut-off events. For 1770/1770 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 54281 event pairs, 1991 based on Foata normal form. 240/10245 useless extension candidates. Maximal degree in co-relation 21783. Up to 5926 conditions per place. [2025-02-06 04:21:20,036 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 48 selfloop transitions, 2 changer transitions 53/107 dead transitions. [2025-02-06 04:21:20,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 107 transitions, 457 flow [2025-02-06 04:21:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:21:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:21:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2025-02-06 04:21:20,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-02-06 04:21:20,038 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 94 flow. Second operand 7 states and 154 transitions. [2025-02-06 04:21:20,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 107 transitions, 457 flow [2025-02-06 04:21:20,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 435 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:21:20,074 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 98 flow [2025-02-06 04:21:20,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-02-06 04:21:20,074 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-02-06 04:21:20,074 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 98 flow [2025-02-06 04:21:20,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-06 04:21:20,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:20,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:20,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:21:20,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash -880855705, now seen corresponding path program 1 times [2025-02-06 04:21:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684197777] [2025-02-06 04:21:20,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:20,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:21:20,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:21:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684197777] [2025-02-06 04:21:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684197777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:21:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301214006] [2025-02-06 04:21:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:20,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:21:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:20,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:21:20,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:21:20,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-02-06 04:21:20,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:20,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:20,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-02-06 04:21:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:21,433 INFO L124 PetriNetUnfolderBase]: 6722/9768 cut-off events. [2025-02-06 04:21:21,433 INFO L125 PetriNetUnfolderBase]: For 1632/1632 co-relation queries the response was YES. [2025-02-06 04:21:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21529 conditions, 9768 events. 6722/9768 cut-off events. For 1632/1632 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 52444 event pairs, 1610 based on Foata normal form. 162/9928 useless extension candidates. Maximal degree in co-relation 21513. Up to 7442 conditions per place. [2025-02-06 04:21:21,472 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 63 selfloop transitions, 6 changer transitions 45/118 dead transitions. [2025-02-06 04:21:21,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 118 transitions, 513 flow [2025-02-06 04:21:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:21:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:21:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2025-02-06 04:21:21,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 04:21:21,474 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 98 flow. Second operand 8 states and 172 transitions. [2025-02-06 04:21:21,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 118 transitions, 513 flow [2025-02-06 04:21:21,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 118 transitions, 491 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:21:21,507 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 141 flow [2025-02-06 04:21:21,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-02-06 04:21:21,508 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2025-02-06 04:21:21,508 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 141 flow [2025-02-06 04:21:21,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:21,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:21,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:21,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:21:21,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:21,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1935585372, now seen corresponding path program 1 times [2025-02-06 04:21:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:21,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714586465] [2025-02-06 04:21:21,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:21,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:21:21,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:21:21,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714586465] [2025-02-06 04:21:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714586465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:21:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776795572] [2025-02-06 04:21:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:21,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:21:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:21,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:21:21,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:21:21,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-02-06 04:21:21,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:21,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:21,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-02-06 04:21:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:23,191 INFO L124 PetriNetUnfolderBase]: 9122/13229 cut-off events. [2025-02-06 04:21:23,191 INFO L125 PetriNetUnfolderBase]: For 7187/7189 co-relation queries the response was YES. [2025-02-06 04:21:23,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33821 conditions, 13229 events. 9122/13229 cut-off events. For 7187/7189 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 72811 event pairs, 599 based on Foata normal form. 116/13342 useless extension candidates. Maximal degree in co-relation 33803. Up to 7279 conditions per place. [2025-02-06 04:21:23,234 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 83 selfloop transitions, 13 changer transitions 35/135 dead transitions. [2025-02-06 04:21:23,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 135 transitions, 708 flow [2025-02-06 04:21:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:21:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:21:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2025-02-06 04:21:23,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2025-02-06 04:21:23,236 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 141 flow. Second operand 8 states and 174 transitions. [2025-02-06 04:21:23,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 135 transitions, 708 flow [2025-02-06 04:21:23,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 135 transitions, 698 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 04:21:23,258 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 244 flow [2025-02-06 04:21:23,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-02-06 04:21:23,260 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-02-06 04:21:23,261 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 244 flow [2025-02-06 04:21:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:23,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:23,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:23,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:21:23,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1172408778, now seen corresponding path program 2 times [2025-02-06 04:21:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252331814] [2025-02-06 04:21:23,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:21:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:23,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:21:23,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:21:23,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:21:23,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252331814] [2025-02-06 04:21:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252331814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:21:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151293702] [2025-02-06 04:21:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:21:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:23,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:21:23,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:21:23,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 04:21:23,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-06 04:21:23,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:23,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 04:21:23,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:24,002 INFO L124 PetriNetUnfolderBase]: 7095/10837 cut-off events. [2025-02-06 04:21:24,002 INFO L125 PetriNetUnfolderBase]: For 10649/10651 co-relation queries the response was YES. [2025-02-06 04:21:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30325 conditions, 10837 events. 7095/10837 cut-off events. For 10649/10651 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 64843 event pairs, 1213 based on Foata normal form. 576/11405 useless extension candidates. Maximal degree in co-relation 30301. Up to 5007 conditions per place. [2025-02-06 04:21:24,072 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 86 selfloop transitions, 5 changer transitions 5/101 dead transitions. [2025-02-06 04:21:24,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 639 flow [2025-02-06 04:21:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:21:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:21:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-06 04:21:24,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-02-06 04:21:24,074 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 244 flow. Second operand 4 states and 110 transitions. [2025-02-06 04:21:24,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 639 flow [2025-02-06 04:21:24,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 635 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 04:21:24,090 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 263 flow [2025-02-06 04:21:24,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-02-06 04:21:24,090 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 04:21:24,090 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 263 flow [2025-02-06 04:21:24,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-06 04:21:24,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:24,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:24,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:21:24,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:24,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1003672242, now seen corresponding path program 1 times [2025-02-06 04:21:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541833964] [2025-02-06 04:21:24,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:21:24,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:21:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:24,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541833964] [2025-02-06 04:21:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541833964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:24,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:21:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031077426] [2025-02-06 04:21:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:21:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:21:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:21:24,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 04:21:24,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:24,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 04:21:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:24,676 INFO L124 PetriNetUnfolderBase]: 4253/6519 cut-off events. [2025-02-06 04:21:24,676 INFO L125 PetriNetUnfolderBase]: For 7211/7213 co-relation queries the response was YES. [2025-02-06 04:21:24,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19669 conditions, 6519 events. 4253/6519 cut-off events. For 7211/7213 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 35284 event pairs, 721 based on Foata normal form. 384/6895 useless extension candidates. Maximal degree in co-relation 19643. Up to 2526 conditions per place. [2025-02-06 04:21:24,711 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 100 selfloop transitions, 8 changer transitions 5/118 dead transitions. [2025-02-06 04:21:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 764 flow [2025-02-06 04:21:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:21:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:21:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-02-06 04:21:24,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558139534883721 [2025-02-06 04:21:24,713 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 263 flow. Second operand 5 states and 141 transitions. [2025-02-06 04:21:24,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 764 flow [2025-02-06 04:21:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 754 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:21:24,721 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 303 flow [2025-02-06 04:21:24,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-02-06 04:21:24,722 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2025-02-06 04:21:24,722 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 303 flow [2025-02-06 04:21:24,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:24,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:24,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:21:24,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash 558205185, now seen corresponding path program 1 times [2025-02-06 04:21:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667738339] [2025-02-06 04:21:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:21:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:21:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667738339] [2025-02-06 04:21:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667738339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:21:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066444362] [2025-02-06 04:21:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:24,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:21:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:24,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:21:24,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:21:24,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 04:21:24,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-06 04:21:24,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:24,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 04:21:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:25,196 INFO L124 PetriNetUnfolderBase]: 2851/4325 cut-off events. [2025-02-06 04:21:25,197 INFO L125 PetriNetUnfolderBase]: For 6407/6409 co-relation queries the response was YES. [2025-02-06 04:21:25,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13705 conditions, 4325 events. 2851/4325 cut-off events. For 6407/6409 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 21701 event pairs, 601 based on Foata normal form. 124/4441 useless extension candidates. Maximal degree in co-relation 13677. Up to 1724 conditions per place. [2025-02-06 04:21:25,215 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 73 selfloop transitions, 11 changer transitions 17/106 dead transitions. [2025-02-06 04:21:25,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 704 flow [2025-02-06 04:21:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:21:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:21:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-02-06 04:21:25,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-02-06 04:21:25,216 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 303 flow. Second operand 6 states and 138 transitions. [2025-02-06 04:21:25,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 704 flow [2025-02-06 04:21:25,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 656 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-06 04:21:25,234 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 246 flow [2025-02-06 04:21:25,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-02-06 04:21:25,235 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-02-06 04:21:25,237 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 246 flow [2025-02-06 04:21:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-06 04:21:25,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:25,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:21:25,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:25,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash 742029344, now seen corresponding path program 1 times [2025-02-06 04:21:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537293715] [2025-02-06 04:21:25,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:21:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:25,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:21:25,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:21:25,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:25,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:21:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:21:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:21:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537293715] [2025-02-06 04:21:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537293715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:21:25,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:21:25,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:21:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147626264] [2025-02-06 04:21:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:21:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:21:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:21:25,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:21:25,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:21:25,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-02-06 04:21:25,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:25,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:21:25,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-02-06 04:21:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:21:25,768 INFO L124 PetriNetUnfolderBase]: 2212/3427 cut-off events. [2025-02-06 04:21:25,769 INFO L125 PetriNetUnfolderBase]: For 4676/4676 co-relation queries the response was YES. [2025-02-06 04:21:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 3427 events. 2212/3427 cut-off events. For 4676/4676 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15917 event pairs, 648 based on Foata normal form. 8/3433 useless extension candidates. Maximal degree in co-relation 10546. Up to 2122 conditions per place. [2025-02-06 04:21:25,780 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 51 selfloop transitions, 1 changer transitions 50/106 dead transitions. [2025-02-06 04:21:25,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 731 flow [2025-02-06 04:21:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:21:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:21:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-02-06 04:21:25,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2025-02-06 04:21:25,781 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 246 flow. Second operand 6 states and 119 transitions. [2025-02-06 04:21:25,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 731 flow [2025-02-06 04:21:25,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 574 flow, removed 36 selfloop flow, removed 11 redundant places. [2025-02-06 04:21:25,792 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 166 flow [2025-02-06 04:21:25,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-02-06 04:21:25,793 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-02-06 04:21:25,793 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 166 flow [2025-02-06 04:21:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:21:25,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:21:25,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:21:25,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:21:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:21:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1087563930, now seen corresponding path program 2 times [2025-02-06 04:21:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:21:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416777147] [2025-02-06 04:21:25,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:21:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:21:25,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:21:25,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:21:25,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:21:25,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:21:25,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:21:25,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:21:25,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:21:25,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:21:25,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:21:25,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:21:25,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:21:25,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:21:25,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:21:25,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:21:25,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:21:25,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 04:21:25,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:21:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:21:25,930 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:21:25,996 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:21:25,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:21:26,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:21:26 BasicIcfg [2025-02-06 04:21:26,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:21:26,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:21:26,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:21:26,002 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:21:26,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:21:15" (3/4) ... [2025-02-06 04:21:26,003 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:21:26,088 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 04:21:26,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:21:26,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:21:26,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:21:26,126 INFO L158 Benchmark]: Toolchain (without parser) took 12104.80ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.7MB in the beginning and 917.3MB in the end (delta: -796.6MB). Peak memory consumption was 353.0MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,127 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:21:26,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.01ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 97.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.22ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 94.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:21:26,130 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 91.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,130 INFO L158 Benchmark]: IcfgBuilder took 565.86ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 38.7MB in the end (delta: 52.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,131 INFO L158 Benchmark]: TraceAbstraction took 10907.55ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 37.8MB in the beginning and 934.1MB in the end (delta: -896.3MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,131 INFO L158 Benchmark]: Witness Printer took 124.31ms. Allocated memory is still 1.3GB. Free memory was 934.1MB in the beginning and 917.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:21:26,132 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.46ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.01ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 97.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.22ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 94.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 91.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 565.86ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 38.7MB in the end (delta: 52.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10907.55ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 37.8MB in the beginning and 934.1MB in the end (delta: -896.3MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. * Witness Printer took 124.31ms. Allocated memory is still 1.3GB. Free memory was 934.1MB in the beginning and 917.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-1, t892=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-1, t892=0, t893=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-1, t892=0, t893=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-1, t892=0, t893=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-1, t892=0, t893=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 677 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1753 IncrementalHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 4 mSDtfsCounter, 1753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:21:26,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE