./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix039.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:07:29,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:07:29,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:07:29,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:07:29,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:07:29,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:07:29,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:07:29,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:07:29,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:07:29,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:07:29,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:07:29,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:07:29,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:07:29,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:07:29,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:07:29,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:07:29,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:07:29,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:07:29,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:07:29,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:07:29,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:07:29,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2025-03-04 02:07:29,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:07:29,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:07:29,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:07:29,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:07:29,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:07:29,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2025-03-04 02:07:30,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409321a48/d8834a4aa35a471e8a82e0295ac24a00/FLAGf8a1d307c [2025-03-04 02:07:31,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:07:31,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2025-03-04 02:07:31,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409321a48/d8834a4aa35a471e8a82e0295ac24a00/FLAGf8a1d307c [2025-03-04 02:07:31,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409321a48/d8834a4aa35a471e8a82e0295ac24a00 [2025-03-04 02:07:31,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:07:31,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:07:31,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:07:31,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:07:31,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:07:31,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502a9161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31, skipping insertion in model container [2025-03-04 02:07:31,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:07:31,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2025-03-04 02:07:31,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:07:31,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:07:31,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2025-03-04 02:07:31,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:07:31,636 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:07:31,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31 WrapperNode [2025-03-04 02:07:31,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:07:31,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:07:31,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:07:31,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:07:31,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,668 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-04 02:07:31,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:07:31,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:07:31,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:07:31,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:07:31,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,691 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:07:31,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:07:31,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:07:31,702 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:07:31,702 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:07:31,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (1/1) ... [2025-03-04 02:07:31,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:07:31,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:07:31,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:07:31,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:07:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:07:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:07:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:07:31,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:07:31,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:07:31,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:07:31,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:07:31,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:07:31,756 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 02:07:31,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 02:07:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:07:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:07:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:07:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:07:31,758 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:07:31,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:07:31,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:07:32,128 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:07:32,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:07:32,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:07:32,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:07:32,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:32 BoogieIcfgContainer [2025-03-04 02:07:32,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:07:32,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:07:32,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:07:32,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:07:32,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:07:31" (1/3) ... [2025-03-04 02:07:32,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa10263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:07:32, skipping insertion in model container [2025-03-04 02:07:32,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:31" (2/3) ... [2025-03-04 02:07:32,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa10263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:07:32, skipping insertion in model container [2025-03-04 02:07:32,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:32" (3/3) ... [2025-03-04 02:07:32,344 INFO L128 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2025-03-04 02:07:32,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:07:32,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix039.oepc.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:07:32,359 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:07:32,417 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:07:32,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:07:32,475 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-04 02:07:32,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:07:32,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-03-04 02:07:32,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:07:32,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-03-04 02:07:32,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:07:32,506 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;@2fc6776d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:07:32,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:07:32,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:07:32,512 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 02:07:32,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:07:32,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:32,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 02:07:32,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:32,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 13248942, now seen corresponding path program 1 times [2025-03-04 02:07:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208307114] [2025-03-04 02:07:32,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:32,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 02:07:32,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 02:07:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208307114] [2025-03-04 02:07:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208307114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:07:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224397431] [2025-03-04 02:07:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:07:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:32,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:07:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:07:32,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:32,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:32,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:32,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:37,331 INFO L124 PetriNetUnfolderBase]: 46139/61138 cut-off events. [2025-03-04 02:07:37,332 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-03-04 02:07:37,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122142 conditions, 61138 events. 46139/61138 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 369839 event pairs, 5699 based on Foata normal form. 1692/62572 useless extension candidates. Maximal degree in co-relation 122130. Up to 52391 conditions per place. [2025-03-04 02:07:37,725 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 63 selfloop transitions, 2 changer transitions 2/74 dead transitions. [2025-03-04 02:07:37,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 303 flow [2025-03-04 02:07:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:07:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:07:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-04 02:07:37,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-03-04 02:07:37,737 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 103 transitions. [2025-03-04 02:07:37,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 303 flow [2025-03-04 02:07:37,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:07:37,747 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-03-04 02:07:37,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-03-04 02:07:37,752 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-04 02:07:37,752 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-03-04 02:07:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:37,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:37,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:37,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:07:37,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1438452445, now seen corresponding path program 1 times [2025-03-04 02:07:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921796049] [2025-03-04 02:07:37,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:37,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:07:37,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:07:37,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:37,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921796049] [2025-03-04 02:07:37,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921796049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:37,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:07:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598812126] [2025-03-04 02:07:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:07:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:37,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:07:37,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:07:37,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:37,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-04 02:07:37,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:37,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:40,647 INFO L124 PetriNetUnfolderBase]: 37115/53601 cut-off events. [2025-03-04 02:07:40,647 INFO L125 PetriNetUnfolderBase]: For 1910/1910 co-relation queries the response was YES. [2025-03-04 02:07:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105569 conditions, 53601 events. 37115/53601 cut-off events. For 1910/1910 co-relation queries the response was YES. Maximal size of possible extension queue 1696. Compared 369979 event pairs, 5075 based on Foata normal form. 1728/53966 useless extension candidates. Maximal degree in co-relation 105559. Up to 28201 conditions per place. [2025-03-04 02:07:40,927 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2025-03-04 02:07:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow [2025-03-04 02:07:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:07:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:07:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-04 02:07:40,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 02:07:40,929 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 130 transitions. [2025-03-04 02:07:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow [2025-03-04 02:07:40,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:07:40,932 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2025-03-04 02:07:40,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 02:07:40,933 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-03-04 02:07:40,933 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2025-03-04 02:07:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-04 02:07:40,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:40,933 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] [2025-03-04 02:07:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:07:40,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1987744008, now seen corresponding path program 1 times [2025-03-04 02:07:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285959293] [2025-03-04 02:07:40,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:40,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:07:40,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:07:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285959293] [2025-03-04 02:07:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285959293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:41,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:07:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115585210] [2025-03-04 02:07:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:41,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:07:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:41,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:07:41,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:07:41,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:41,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:41,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:41,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:41,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:43,579 INFO L124 PetriNetUnfolderBase]: 23963/34433 cut-off events. [2025-03-04 02:07:43,580 INFO L125 PetriNetUnfolderBase]: For 6758/6758 co-relation queries the response was YES. [2025-03-04 02:07:43,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76593 conditions, 34433 events. 23963/34433 cut-off events. For 6758/6758 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 217346 event pairs, 2975 based on Foata normal form. 1344/35118 useless extension candidates. Maximal degree in co-relation 76581. Up to 12361 conditions per place. [2025-03-04 02:07:43,806 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions. [2025-03-04 02:07:43,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow [2025-03-04 02:07:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:07:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:07:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-03-04 02:07:43,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-03-04 02:07:43,808 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 168 transitions. [2025-03-04 02:07:43,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow [2025-03-04 02:07:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:07:43,820 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2025-03-04 02:07:43,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-04 02:07:43,821 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-04 02:07:43,822 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2025-03-04 02:07:43,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:43,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:43,822 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] [2025-03-04 02:07:43,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:07:43,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash -465381854, now seen corresponding path program 1 times [2025-03-04 02:07:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:43,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962603032] [2025-03-04 02:07:43,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:43,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:07:43,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:07:43,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962603032] [2025-03-04 02:07:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962603032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:07:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269575314] [2025-03-04 02:07:44,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:44,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:44,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:44,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:44,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:44,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:44,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:44,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:45,306 INFO L124 PetriNetUnfolderBase]: 14779/20705 cut-off events. [2025-03-04 02:07:45,307 INFO L125 PetriNetUnfolderBase]: For 12790/12790 co-relation queries the response was YES. [2025-03-04 02:07:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50685 conditions, 20705 events. 14779/20705 cut-off events. For 12790/12790 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 114097 event pairs, 2591 based on Foata normal form. 640/21166 useless extension candidates. Maximal degree in co-relation 50671. Up to 6144 conditions per place. [2025-03-04 02:07:45,440 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions. [2025-03-04 02:07:45,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow [2025-03-04 02:07:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:07:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:07:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-03-04 02:07:45,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 02:07:45,442 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 204 transitions. [2025-03-04 02:07:45,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow [2025-03-04 02:07:45,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:07:45,633 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2025-03-04 02:07:45,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:07:45,633 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-03-04 02:07:45,634 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2025-03-04 02:07:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:45,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:45,634 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] [2025-03-04 02:07:45,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:07:45,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:45,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -796166064, now seen corresponding path program 1 times [2025-03-04 02:07:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:45,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802644576] [2025-03-04 02:07:45,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:45,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:07:45,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:07:45,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:45,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:45,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-03-04 02:07:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802644576] [2025-03-04 02:07:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802644576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025848410] [2025-03-04 02:07:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:07:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:45,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:07:45,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:07:45,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:45,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:45,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:45,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:46,933 INFO L124 PetriNetUnfolderBase]: 11683/15977 cut-off events. [2025-03-04 02:07:46,933 INFO L125 PetriNetUnfolderBase]: For 12398/12398 co-relation queries the response was YES. [2025-03-04 02:07:46,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40542 conditions, 15977 events. 11683/15977 cut-off events. For 12398/12398 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 83081 event pairs, 2399 based on Foata normal form. 160/16102 useless extension candidates. Maximal degree in co-relation 40527. Up to 6144 conditions per place. [2025-03-04 02:07:47,020 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions. [2025-03-04 02:07:47,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow [2025-03-04 02:07:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:07:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:07:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-03-04 02:07:47,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-03-04 02:07:47,022 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 202 transitions. [2025-03-04 02:07:47,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow [2025-03-04 02:07:47,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 604 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 02:07:47,227 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2025-03-04 02:07:47,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-03-04 02:07:47,228 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-04 02:07:47,228 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2025-03-04 02:07:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:47,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:47,229 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, 1, 1, 1, 1, 1] [2025-03-04 02:07:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:07:47,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:47,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1846196299, now seen corresponding path program 1 times [2025-03-04 02:07:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107014177] [2025-03-04 02:07:47,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:47,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:47,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107014177] [2025-03-04 02:07:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107014177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796447695] [2025-03-04 02:07:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:47,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:47,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:47,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:47,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:47,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:47,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:47,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:47,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:49,209 INFO L124 PetriNetUnfolderBase]: 17367/23735 cut-off events. [2025-03-04 02:07:49,210 INFO L125 PetriNetUnfolderBase]: For 17916/17916 co-relation queries the response was YES. [2025-03-04 02:07:49,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60581 conditions, 23735 events. 17367/23735 cut-off events. For 17916/17916 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 131022 event pairs, 3379 based on Foata normal form. 16/23744 useless extension candidates. Maximal degree in co-relation 60565. Up to 13273 conditions per place. [2025-03-04 02:07:49,285 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 83 selfloop transitions, 6 changer transitions 25/120 dead transitions. [2025-03-04 02:07:49,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 742 flow [2025-03-04 02:07:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:07:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:07:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-03-04 02:07:49,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-03-04 02:07:49,286 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 6 states and 151 transitions. [2025-03-04 02:07:49,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 742 flow [2025-03-04 02:07:49,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 120 transitions, 553 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-03-04 02:07:49,543 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 187 flow [2025-03-04 02:07:49,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-03-04 02:07:49,544 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-04 02:07:49,544 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 187 flow [2025-03-04 02:07:49,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:49,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:49,544 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, 1, 1, 1, 1, 1] [2025-03-04 02:07:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:07:49,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 854094565, now seen corresponding path program 2 times [2025-03-04 02:07:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429372211] [2025-03-04 02:07:49,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:07:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:49,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:49,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:49,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:07:49,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429372211] [2025-03-04 02:07:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429372211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:51,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:07:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596735035] [2025-03-04 02:07:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:07:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:07:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:07:51,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:51,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:51,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:51,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:51,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:53,222 INFO L124 PetriNetUnfolderBase]: 14113/19639 cut-off events. [2025-03-04 02:07:53,222 INFO L125 PetriNetUnfolderBase]: For 4014/4014 co-relation queries the response was YES. [2025-03-04 02:07:53,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46850 conditions, 19639 events. 14113/19639 cut-off events. For 4014/4014 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 107216 event pairs, 2861 based on Foata normal form. 16/19652 useless extension candidates. Maximal degree in co-relation 46835. Up to 6469 conditions per place. [2025-03-04 02:07:53,341 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 141 selfloop transitions, 4 changer transitions 51/202 dead transitions. [2025-03-04 02:07:53,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 202 transitions, 1031 flow [2025-03-04 02:07:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:07:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:07:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2025-03-04 02:07:53,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 02:07:53,343 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 187 flow. Second operand 8 states and 224 transitions. [2025-03-04 02:07:53,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 202 transitions, 1031 flow [2025-03-04 02:07:53,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 1004 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:07:53,349 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 206 flow [2025-03-04 02:07:53,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-03-04 02:07:53,350 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2025-03-04 02:07:53,350 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 206 flow [2025-03-04 02:07:53,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:53,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:53,350 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, 1, 1, 1, 1, 1] [2025-03-04 02:07:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:07:53,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash -12273725, now seen corresponding path program 3 times [2025-03-04 02:07:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45065615] [2025-03-04 02:07:53,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:07:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:53,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:53,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:53,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:07:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:53,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45065615] [2025-03-04 02:07:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45065615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:53,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:07:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941051518] [2025-03-04 02:07:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:07:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:07:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:07:53,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:53,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:53,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:53,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:53,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:55,536 INFO L124 PetriNetUnfolderBase]: 19896/27702 cut-off events. [2025-03-04 02:07:55,536 INFO L125 PetriNetUnfolderBase]: For 12096/12096 co-relation queries the response was YES. [2025-03-04 02:07:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70006 conditions, 27702 events. 19896/27702 cut-off events. For 12096/12096 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 154390 event pairs, 1389 based on Foata normal form. 32/27723 useless extension candidates. Maximal degree in co-relation 69987. Up to 13508 conditions per place. [2025-03-04 02:07:55,720 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 86 selfloop transitions, 6 changer transitions 80/178 dead transitions. [2025-03-04 02:07:55,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 178 transitions, 959 flow [2025-03-04 02:07:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:07:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:07:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2025-03-04 02:07:55,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.505 [2025-03-04 02:07:55,722 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 206 flow. Second operand 8 states and 202 transitions. [2025-03-04 02:07:55,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 178 transitions, 959 flow [2025-03-04 02:07:55,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 178 transitions, 937 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:07:55,732 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 237 flow [2025-03-04 02:07:55,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=237, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2025-03-04 02:07:55,733 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-04 02:07:55,733 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 237 flow [2025-03-04 02:07:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:55,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:55,733 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, 1, 1, 1, 1, 1] [2025-03-04 02:07:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:07:55,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1559777797, now seen corresponding path program 4 times [2025-03-04 02:07:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708866095] [2025-03-04 02:07:55,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:07:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:55,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:07:55,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:55,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:07:55,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:55,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708866095] [2025-03-04 02:07:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708866095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:55,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681431808] [2025-03-04 02:07:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:55,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:55,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:55,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:55,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:07:55,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:55,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:55,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:07:55,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:57,488 INFO L124 PetriNetUnfolderBase]: 17478/24900 cut-off events. [2025-03-04 02:07:57,489 INFO L125 PetriNetUnfolderBase]: For 17133/17133 co-relation queries the response was YES. [2025-03-04 02:07:57,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67317 conditions, 24900 events. 17478/24900 cut-off events. For 17133/17133 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 141652 event pairs, 8485 based on Foata normal form. 32/24928 useless extension candidates. Maximal degree in co-relation 67295. Up to 12171 conditions per place. [2025-03-04 02:07:57,688 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 55 selfloop transitions, 1 changer transitions 75/136 dead transitions. [2025-03-04 02:07:57,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 758 flow [2025-03-04 02:07:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:07:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:07:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-03-04 02:07:57,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46 [2025-03-04 02:07:57,690 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 237 flow. Second operand 7 states and 161 transitions. [2025-03-04 02:07:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 758 flow [2025-03-04 02:07:57,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 136 transitions, 748 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:07:57,707 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 212 flow [2025-03-04 02:07:57,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2025-03-04 02:07:57,709 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-03-04 02:07:57,709 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 212 flow [2025-03-04 02:07:57,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:57,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:57,709 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, 1, 1, 1, 1, 1] [2025-03-04 02:07:57,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:07:57,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -894190925, now seen corresponding path program 5 times [2025-03-04 02:07:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112465847] [2025-03-04 02:07:57,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:07:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:57,722 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:57,768 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:57,768 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:07:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:07:57,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:07:57,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:57,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:07:57,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:07:57,859 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:07:57,860 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 02:07:57,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:07:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:07:57,862 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-04 02:07:57,947 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:07:57,947 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:07:57,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:07:57 BasicIcfg [2025-03-04 02:07:57,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:07:57,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:07:57,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:07:57,951 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:07:57,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:32" (3/4) ... [2025-03-04 02:07:57,953 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:07:58,041 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 02:07:58,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:07:58,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:07:58,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:07:58,083 INFO L158 Benchmark]: Toolchain (without parser) took 26792.69ms. Allocated memory was 142.6MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 105.1MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-04 02:07:58,083 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:07:58,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 80.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:07:58,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:07:58,084 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:07:58,084 INFO L158 Benchmark]: IcfgBuilder took 633.61ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 85.0MB in the end (delta: -9.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-04 02:07:58,085 INFO L158 Benchmark]: TraceAbstraction took 25614.10ms. Allocated memory was 142.6MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 84.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-04 02:07:58,085 INFO L158 Benchmark]: Witness Printer took 130.58ms. Allocated memory is still 5.4GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:07:58,087 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 80.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 633.61ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 85.0MB in the end (delta: -9.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25614.10ms. Allocated memory was 142.6MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 84.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 130.58ms. Allocated memory is still 5.4GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025=-3, t1026=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L767] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025=-3, t1026=-2, t1027=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025=-3, t1026=-2, t1027=-1, t1028=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025=-3, t1026=-2, t1027=-1, t1028=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025=-3, t1026=-2, t1027=-1, t1028=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025=-3, t1026=-2, t1027=-1, t1028=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, 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: 878]: 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: 874]: 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: 872]: 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: 876]: 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 9 procedures, 85 locations, 7 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: 25.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2303 IncrementalHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 4 mSDtfsCounter, 2303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 54, 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.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1531 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-03-04 02:07:58,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE