/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:50,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:50,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:37:50,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:50,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:50,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:50,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:50,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:50,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:50,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:50,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:50,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:50,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:50,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:50,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:50,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:50,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:50,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:50,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:50,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:50,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:50,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:37:50,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:50,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:50,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:50,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:50,828 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:50,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2025-04-13 19:37:52,175 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950cbcb1c/e00bda47dffb4496884b260f47cb3c94/FLAG975ecbd0c [2025-04-13 19:37:52,448 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:52,448 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2025-04-13 19:37:52,464 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950cbcb1c/e00bda47dffb4496884b260f47cb3c94/FLAG975ecbd0c [2025-04-13 19:37:53,377 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950cbcb1c/e00bda47dffb4496884b260f47cb3c94 [2025-04-13 19:37:53,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:53,380 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:53,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:53,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:53,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:53,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7139437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53, skipping insertion in model container [2025-04-13 19:37:53,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:53,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i[995,1008] [2025-04-13 19:37:53,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:53,778 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:53,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i[995,1008] [2025-04-13 19:37:53,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:53,888 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:53,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53 WrapperNode [2025-04-13 19:37:53,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:53,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:53,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:53,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:53,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,932 INFO L138 Inliner]: procedures = 176, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2025-04-13 19:37:53,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:53,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:53,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:53,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:53,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,963 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-04-13 19:37:53,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:53,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:53,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:53,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:53,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:54,000 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-04-13 19:37:54,001 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-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:37:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:37:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:37:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:37:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:54,020 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:37:54,132 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:54,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:54,421 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:54,422 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:54,422 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:54,750 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:54,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:54 BoogieIcfgContainer [2025-04-13 19:37:54,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:54,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:54,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:54,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:54,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:53" (1/3) ... [2025-04-13 19:37:54,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a050756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:54, skipping insertion in model container [2025-04-13 19:37:54,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53" (2/3) ... [2025-04-13 19:37:54,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a050756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:54, skipping insertion in model container [2025-04-13 19:37:54,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:54" (3/3) ... [2025-04-13 19:37:54,758 INFO L128 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2025-04-13 19:37:54,770 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:54,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thin002_power.oepc.i that has 5 procedures, 44 locations, 39 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:37:54,773 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:54,817 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:54,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 102 flow [2025-04-13 19:37:54,865 INFO L116 PetriNetUnfolderBase]: 0/39 cut-off events. [2025-04-13 19:37:54,867 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:37:54,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 43 transitions, 102 flow [2025-04-13 19:37:54,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-04-13 19:37:54,874 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:54,882 INFO L340 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;@1b2e1612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:54,882 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:37:54,895 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:54,895 INFO L116 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-04-13 19:37:54,895 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:54,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:54,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:54,896 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:54,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash -540591430, now seen corresponding path program 1 times [2025-04-13 19:37:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:54,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631630596] [2025-04-13 19:37:54,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:54,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:54,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:55,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:55,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:55,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:55,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631630596] [2025-04-13 19:37:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631630596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5702005] [2025-04-13 19:37:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:55,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:55,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:55,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:55,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:55,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-04-13 19:37:55,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:55,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:55,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,020 INFO L116 PetriNetUnfolderBase]: 1137/1916 cut-off events. [2025-04-13 19:37:56,020 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 19:37:56,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1916 events. 1137/1916 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 12321 event pairs, 513 based on Foata normal form. 72/1954 useless extension candidates. Maximal degree in co-relation 3626. Up to 1141 conditions per place. [2025-04-13 19:37:56,039 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 32 selfloop transitions, 2 changer transitions 15/66 dead transitions. [2025-04-13 19:37:56,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 248 flow [2025-04-13 19:37:56,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-04-13 19:37:56,052 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7255813953488373 [2025-04-13 19:37:56,053 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 5 states and 156 transitions. [2025-04-13 19:37:56,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 248 flow [2025-04-13 19:37:56,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 242 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:56,062 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 96 flow [2025-04-13 19:37:56,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-04-13 19:37:56,067 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-04-13 19:37:56,067 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 96 flow [2025-04-13 19:37:56,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-04-13 19:37:56,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:56,068 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:56,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 183491835, now seen corresponding path program 1 times [2025-04-13 19:37:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376479612] [2025-04-13 19:37:56,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:37:56,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:37:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376479612] [2025-04-13 19:37:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376479612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:56,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482738694] [2025-04-13 19:37:56,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:56,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:56,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-04-13 19:37:56,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-04-13 19:37:56,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-04-13 19:37:56,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,858 INFO L116 PetriNetUnfolderBase]: 1653/2993 cut-off events. [2025-04-13 19:37:56,858 INFO L117 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-04-13 19:37:56,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 2993 events. 1653/2993 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 22693 event pairs, 505 based on Foata normal form. 64/2963 useless extension candidates. Maximal degree in co-relation 5955. Up to 744 conditions per place. [2025-04-13 19:37:56,870 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 44 selfloop transitions, 3 changer transitions 18/81 dead transitions. [2025-04-13 19:37:56,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 329 flow [2025-04-13 19:37:56,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2025-04-13 19:37:56,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-04-13 19:37:56,872 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 96 flow. Second operand 6 states and 187 transitions. [2025-04-13 19:37:56,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 329 flow [2025-04-13 19:37:56,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 319 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:56,877 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 106 flow [2025-04-13 19:37:56,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-04-13 19:37:56,878 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2025-04-13 19:37:56,878 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 106 flow [2025-04-13 19:37:56,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-04-13 19:37:56,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:56,883 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:56,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2037430162, now seen corresponding path program 1 times [2025-04-13 19:37:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059999275] [2025-04-13 19:37:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:37:56,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:37:56,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:57,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059999275] [2025-04-13 19:37:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059999275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401218580] [2025-04-13 19:37:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:57,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:57,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:57,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:57,107 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:57,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04-13 19:37:57,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:57,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:57,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:57,315 INFO L116 PetriNetUnfolderBase]: 659/1108 cut-off events. [2025-04-13 19:37:57,315 INFO L117 PetriNetUnfolderBase]: For 353/363 co-relation queries the response was YES. [2025-04-13 19:37:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1108 events. 659/1108 cut-off events. For 353/363 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6739 event pairs, 235 based on Foata normal form. 40/1110 useless extension candidates. Maximal degree in co-relation 2332. Up to 729 conditions per place. [2025-04-13 19:37:57,323 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 26 selfloop transitions, 2 changer transitions 11/56 dead transitions. [2025-04-13 19:37:57,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 226 flow [2025-04-13 19:37:57,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-04-13 19:37:57,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6790697674418604 [2025-04-13 19:37:57,325 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 106 flow. Second operand 5 states and 146 transitions. [2025-04-13 19:37:57,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 226 flow [2025-04-13 19:37:57,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 206 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 19:37:57,327 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 102 flow [2025-04-13 19:37:57,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2025-04-13 19:37:57,330 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-04-13 19:37:57,330 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 102 flow [2025-04-13 19:37:57,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04-13 19:37:57,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:57,330 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-04-13 19:37:57,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:57,331 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:57,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1577092367, now seen corresponding path program 1 times [2025-04-13 19:37:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:57,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993429625] [2025-04-13 19:37:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:37:57,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:37:57,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:57,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:57,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993429625] [2025-04-13 19:37:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993429625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081416473] [2025-04-13 19:37:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:57,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:57,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-04-13 19:37:57,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-13 19:37:57,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:57,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-04-13 19:37:57,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:58,001 INFO L116 PetriNetUnfolderBase]: 1310/2249 cut-off events. [2025-04-13 19:37:58,001 INFO L117 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-04-13 19:37:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 2249 events. 1310/2249 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14973 event pairs, 228 based on Foata normal form. 48/2274 useless extension candidates. Maximal degree in co-relation 4567. Up to 730 conditions per place. [2025-04-13 19:37:58,009 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 34 selfloop transitions, 3 changer transitions 21/74 dead transitions. [2025-04-13 19:37:58,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 303 flow [2025-04-13 19:37:58,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-04-13 19:37:58,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-04-13 19:37:58,010 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 102 flow. Second operand 6 states and 180 transitions. [2025-04-13 19:37:58,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 303 flow [2025-04-13 19:37:58,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 293 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:58,014 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 112 flow [2025-04-13 19:37:58,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-04-13 19:37:58,015 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-04-13 19:37:58,015 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 112 flow [2025-04-13 19:37:58,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-13 19:37:58,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:58,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:58,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:58,015 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:58,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1708853882, now seen corresponding path program 1 times [2025-04-13 19:37:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:58,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546203782] [2025-04-13 19:37:58,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:58,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:37:58,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:37:58,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:58,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546203782] [2025-04-13 19:37:58,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546203782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:58,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311812151] [2025-04-13 19:37:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:58,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:58,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:58,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:58,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-04-13 19:37:58,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-13 19:37:58,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:58,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-04-13 19:37:58,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:58,484 INFO L116 PetriNetUnfolderBase]: 1170/2112 cut-off events. [2025-04-13 19:37:58,485 INFO L117 PetriNetUnfolderBase]: For 859/865 co-relation queries the response was YES. [2025-04-13 19:37:58,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4450 conditions, 2112 events. 1170/2112 cut-off events. For 859/865 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13791 event pairs, 338 based on Foata normal form. 48/2138 useless extension candidates. Maximal degree in co-relation 4434. Up to 657 conditions per place. [2025-04-13 19:37:58,495 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 34 selfloop transitions, 3 changer transitions 23/76 dead transitions. [2025-04-13 19:37:58,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 330 flow [2025-04-13 19:37:58,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-04-13 19:37:58,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-04-13 19:37:58,496 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 112 flow. Second operand 6 states and 182 transitions. [2025-04-13 19:37:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 330 flow [2025-04-13 19:37:58,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 306 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-04-13 19:37:58,500 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 114 flow [2025-04-13 19:37:58,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2025-04-13 19:37:58,504 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-04-13 19:37:58,504 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 114 flow [2025-04-13 19:37:58,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-13 19:37:58,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:58,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:58,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:58,504 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:58,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2104659196, now seen corresponding path program 1 times [2025-04-13 19:37:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:58,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626045204] [2025-04-13 19:37:58,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:58,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:37:58,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:37:58,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:58,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:59,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626045204] [2025-04-13 19:37:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626045204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833177503] [2025-04-13 19:37:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:59,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:59,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:59,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 38 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-04-13 19:37:59,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:59,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,442 INFO L116 PetriNetUnfolderBase]: 452/834 cut-off events. [2025-04-13 19:37:59,443 INFO L117 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-04-13 19:37:59,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 834 events. 452/834 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4294 event pairs, 64 based on Foata normal form. 32/835 useless extension candidates. Maximal degree in co-relation 1795. Up to 465 conditions per place. [2025-04-13 19:37:59,447 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 32 selfloop transitions, 3 changer transitions 10/63 dead transitions. [2025-04-13 19:37:59,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 268 flow [2025-04-13 19:37:59,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-04-13 19:37:59,449 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-04-13 19:37:59,449 INFO L175 Difference]: Start difference. First operand has 60 places, 38 transitions, 114 flow. Second operand 6 states and 179 transitions. [2025-04-13 19:37:59,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 268 flow [2025-04-13 19:37:59,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 242 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-04-13 19:37:59,451 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 108 flow [2025-04-13 19:37:59,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-04-13 19:37:59,453 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-04-13 19:37:59,453 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 108 flow [2025-04-13 19:37:59,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-04-13 19:37:59,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,453 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-04-13 19:37:59,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:59,454 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:59,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1623152570, now seen corresponding path program 1 times [2025-04-13 19:37:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169220397] [2025-04-13 19:37:59,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:37:59,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:37:59,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169220397] [2025-04-13 19:37:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169220397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743227738] [2025-04-13 19:37:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:59,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:59,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-04-13 19:37:59,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04-13 19:37:59,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-04-13 19:37:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,874 INFO L116 PetriNetUnfolderBase]: 2688/3805 cut-off events. [2025-04-13 19:37:59,874 INFO L117 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-04-13 19:37:59,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8443 conditions, 3805 events. 2688/3805 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19682 event pairs, 460 based on Foata normal form. 136/3894 useless extension candidates. Maximal degree in co-relation 8429. Up to 2285 conditions per place. [2025-04-13 19:37:59,896 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 42 selfloop transitions, 6 changer transitions 1/62 dead transitions. [2025-04-13 19:37:59,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 266 flow [2025-04-13 19:37:59,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-13 19:37:59,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-04-13 19:37:59,897 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 108 flow. Second operand 4 states and 119 transitions. [2025-04-13 19:37:59,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 266 flow [2025-04-13 19:37:59,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 252 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-04-13 19:37:59,904 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 140 flow [2025-04-13 19:37:59,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-04-13 19:37:59,905 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2025-04-13 19:37:59,905 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 140 flow [2025-04-13 19:37:59,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04-13 19:37:59,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:59,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:37:59,906 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:59,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1944899987, now seen corresponding path program 1 times [2025-04-13 19:37:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242634085] [2025-04-13 19:37:59,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 19:37:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 19:37:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:00,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242634085] [2025-04-13 19:38:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242634085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:38:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344016828] [2025-04-13 19:38:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:00,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:00,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:00,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:00,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-04-13 19:38:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-04-13 19:38:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-04-13 19:38:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:00,360 INFO L116 PetriNetUnfolderBase]: 2387/3412 cut-off events. [2025-04-13 19:38:00,360 INFO L117 PetriNetUnfolderBase]: For 1346/1498 co-relation queries the response was YES. [2025-04-13 19:38:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8790 conditions, 3412 events. 2387/3412 cut-off events. For 1346/1498 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16790 event pairs, 279 based on Foata normal form. 137/3512 useless extension candidates. Maximal degree in co-relation 8776. Up to 1889 conditions per place. [2025-04-13 19:38:00,384 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 53 selfloop transitions, 10 changer transitions 1/77 dead transitions. [2025-04-13 19:38:00,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 370 flow [2025-04-13 19:38:00,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-04-13 19:38:00,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7023255813953488 [2025-04-13 19:38:00,385 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 140 flow. Second operand 5 states and 151 transitions. [2025-04-13 19:38:00,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 370 flow [2025-04-13 19:38:00,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 359 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:38:00,387 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 192 flow [2025-04-13 19:38:00,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2025-04-13 19:38:00,388 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-04-13 19:38:00,388 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 192 flow [2025-04-13 19:38:00,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-04-13 19:38:00,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:00,388 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] [2025-04-13 19:38:00,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:38:00,388 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:38:00,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1326722768, now seen corresponding path program 1 times [2025-04-13 19:38:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:00,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506906006] [2025-04-13 19:38:00,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:00,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 19:38:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:38:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:00,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506906006] [2025-04-13 19:38:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506906006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:00,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581471106] [2025-04-13 19:38:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:00,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:38:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:00,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:38:00,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:38:00,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-04-13 19:38:00,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-04-13 19:38:00,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:00,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-04-13 19:38:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:00,822 INFO L116 PetriNetUnfolderBase]: 1717/2506 cut-off events. [2025-04-13 19:38:00,822 INFO L117 PetriNetUnfolderBase]: For 2390/2657 co-relation queries the response was YES. [2025-04-13 19:38:00,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7194 conditions, 2506 events. 1717/2506 cut-off events. For 2390/2657 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11546 event pairs, 57 based on Foata normal form. 122/2595 useless extension candidates. Maximal degree in co-relation 7178. Up to 1025 conditions per place. [2025-04-13 19:38:00,834 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 62 selfloop transitions, 14 changer transitions 1/90 dead transitions. [2025-04-13 19:38:00,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 486 flow [2025-04-13 19:38:00,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:38:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:38:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-13 19:38:00,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-04-13 19:38:00,836 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 192 flow. Second operand 6 states and 181 transitions. [2025-04-13 19:38:00,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 486 flow [2025-04-13 19:38:00,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:00,839 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 242 flow [2025-04-13 19:38:00,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2025-04-13 19:38:00,839 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-04-13 19:38:00,840 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 242 flow [2025-04-13 19:38:00,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-04-13 19:38:00,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:00,840 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] [2025-04-13 19:38:00,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:38:00,840 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:38:00,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash 886489441, now seen corresponding path program 1 times [2025-04-13 19:38:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:00,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218457080] [2025-04-13 19:38:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:00,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:38:00,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:38:00,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:00,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:00,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218457080] [2025-04-13 19:38:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218457080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014668534] [2025-04-13 19:38:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:00,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:00,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:00,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:00,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-04-13 19:38:00,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-04-13 19:38:00,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:00,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-04-13 19:38:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:01,236 INFO L116 PetriNetUnfolderBase]: 1061/1578 cut-off events. [2025-04-13 19:38:01,236 INFO L117 PetriNetUnfolderBase]: For 2897/3185 co-relation queries the response was YES. [2025-04-13 19:38:01,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4967 conditions, 1578 events. 1061/1578 cut-off events. For 2897/3185 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6478 event pairs, 57 based on Foata normal form. 77/1622 useless extension candidates. Maximal degree in co-relation 4950. Up to 568 conditions per place. [2025-04-13 19:38:01,244 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 57 selfloop transitions, 18 changer transitions 1/89 dead transitions. [2025-04-13 19:38:01,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 491 flow [2025-04-13 19:38:01,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-04-13 19:38:01,245 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.654485049833887 [2025-04-13 19:38:01,245 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 242 flow. Second operand 7 states and 197 transitions. [2025-04-13 19:38:01,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 491 flow [2025-04-13 19:38:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 434 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-13 19:38:01,252 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 244 flow [2025-04-13 19:38:01,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-13 19:38:01,253 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-04-13 19:38:01,253 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 244 flow [2025-04-13 19:38:01,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-04-13 19:38:01,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:01,253 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] [2025-04-13 19:38:01,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:38:01,254 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:38:01,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1792512564, now seen corresponding path program 1 times [2025-04-13 19:38:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:01,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470557496] [2025-04-13 19:38:01,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 19:38:01,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 19:38:01,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:01,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:01,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:38:01,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 19:38:01,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 19:38:01,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:01,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:01,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:38:01,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:38:01,396 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:38:01,398 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 19:38:01,398 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:38:01,398 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:38:01,398 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:38:01,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:38:01,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:01,531 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:38:01,532 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:38:01,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:38:01 BasicIcfg [2025-04-13 19:38:01,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:38:01,539 INFO L158 Benchmark]: Toolchain (without parser) took 8159.25ms. Allocated memory was 142.6MB in the beginning and 440.4MB in the end (delta: 297.8MB). Free memory was 98.4MB in the beginning and 256.8MB in the end (delta: -158.4MB). Peak memory consumption was 140.5MB. Max. memory is 8.0GB. [2025-04-13 19:38:01,539 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:01,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.90ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 71.0MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:38:01,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.82ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 68.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:01,539 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 64.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:01,540 INFO L158 Benchmark]: RCFGBuilder took 774.36ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 86.0MB in the end (delta: -21.1MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2025-04-13 19:38:01,540 INFO L158 Benchmark]: TraceAbstraction took 6786.39ms. Allocated memory was 142.6MB in the beginning and 440.4MB in the end (delta: 297.8MB). Free memory was 86.0MB in the beginning and 256.8MB in the end (delta: -170.9MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB. [2025-04-13 19:38:01,541 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.90ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 71.0MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.82ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 68.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 64.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 774.36ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 86.0MB in the end (delta: -21.1MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6786.39ms. Allocated memory was 142.6MB in the beginning and 440.4MB in the end (delta: 297.8MB). Free memory was 86.0MB in the beginning and 256.8MB in the end (delta: -170.9MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2705; [L862] FCALL, FORK 0 pthread_create(&t2705, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] EXPR 1 \read(a) [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L778] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L779] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L780] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L781] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L782] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L783] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L784] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L785] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L786] EXPR 1 \read(a) [L786] 1 __unbuffered_p0_EAX = a [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] EXPR 1 \read(a) [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] 1 a = a$flush_delayed ? a$mem_tmp : a [L788] 1 a$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t2706; [L864] FCALL, FORK 0 pthread_create(&t2706, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705=-3, t2706=-2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t2707; [L866] FCALL, FORK 0 pthread_create(&t2707, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705=-3, t2706=-2, t2707=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t2708; [L868] FCALL, FORK 0 pthread_create(&t2708, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705=-3, t2706=-2, t2707=-1, t2708=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L791] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L796] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L803] 2 __unbuffered_p1_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L806] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=0] [L818] 3 __unbuffered_p2_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=0] [L821] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L833] 4 __unbuffered_p3_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L836] 4 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 \read(a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2705=-3, t2706=-2, t2707=-1, t2708=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 \read(a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2705=-3, t2706=-2, t2707=-1, t2708=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2705=-3, t2706=-2, t2707=-1, t2708=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 868]: 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: 866]: 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: 864]: 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: 862]: 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, 76 locations, 71 edges, 5 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: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 498 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 14 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-04-13 19:38:01,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...