./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:24:21,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:24:21,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:24:21,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:24:21,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:24:21,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:24:21,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:24:21,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:24:21,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:24:21,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:24:21,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:24:21,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:24:21,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:24:21,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:24:21,443 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:24:21,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:24:21,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:24:21,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:24:21,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:24:21,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:24:21,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:24:21,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:24:21,446 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2025-03-17 06:24:21,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:24:21,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:24:21,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:24:21,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:24:21,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:24:21,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-03-17 06:24:22,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028cf7524/127e7c1dd36543c3929a11f3c2e5f3db/FLAG21dc4b4ed [2025-03-17 06:24:23,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:24:23,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-03-17 06:24:23,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028cf7524/127e7c1dd36543c3929a11f3c2e5f3db/FLAG21dc4b4ed [2025-03-17 06:24:23,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028cf7524/127e7c1dd36543c3929a11f3c2e5f3db [2025-03-17 06:24:23,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:24:23,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:24:23,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:24:23,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:24:23,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:24:23,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5deddda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23, skipping insertion in model container [2025-03-17 06:24:23,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:24:23,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2025-03-17 06:24:23,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:24:23,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:24:23,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2025-03-17 06:24:23,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:24:23,599 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:24:23,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23 WrapperNode [2025-03-17 06:24:23,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:24:23,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:24:23,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:24:23,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:24:23,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,646 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2025-03-17 06:24:23,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:24:23,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:24:23,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:24:23,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:24:23,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 06:24:23,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:24:23,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:24:23,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:24:23,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:24:23,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (1/1) ... [2025-03-17 06:24:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:24:23,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:24:23,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:24:23,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:24:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 06:24:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 06:24:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 06:24:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:24:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:24:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:24:23,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:24:23,756 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:24:23,878 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:24:23,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:24:24,145 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:24:24,146 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:24:24,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:24:24,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:24:24,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:24:24 BoogieIcfgContainer [2025-03-17 06:24:24,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:24:24,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:24:24,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:24:24,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:24:24,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:24:23" (1/3) ... [2025-03-17 06:24:24,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6354106f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:24:24, skipping insertion in model container [2025-03-17 06:24:24,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:23" (2/3) ... [2025-03-17 06:24:24,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6354106f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:24:24, skipping insertion in model container [2025-03-17 06:24:24,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:24:24" (3/3) ... [2025-03-17 06:24:24,321 INFO L128 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2025-03-17 06:24:24,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:24:24,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix025_pso.opt_rmo.opt.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-17 06:24:24,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:24:24,382 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:24:24,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-03-17 06:24:24,431 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-03-17 06:24:24,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:24:24,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-17 06:24:24,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-03-17 06:24:24,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-03-17 06:24:24,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:24:24,453 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d17aeb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:24:24,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:24:24,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:24:24,458 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-17 06:24:24,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:24:24,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:24,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 06:24:24,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:24,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1746887444, now seen corresponding path program 1 times [2025-03-17 06:24:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-17 06:24:24,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:24,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:24,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 06:24:24,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 06:24:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:24,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-17 06:24:24,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109224028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:24,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:24,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 06:24:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884630139] [2025-03-17 06:24:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:24,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:24:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:24,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:24:24,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:24:24,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:24,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:25,788 INFO L124 PetriNetUnfolderBase]: 4967/7182 cut-off events. [2025-03-17 06:24:25,789 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 06:24:25,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14341 conditions, 7182 events. 4967/7182 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 39072 event pairs, 547 based on Foata normal form. 246/7382 useless extension candidates. Maximal degree in co-relation 14330. Up to 6161 conditions per place. [2025-03-17 06:24:25,844 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-03-17 06:24:25,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 220 flow [2025-03-17 06:24:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:24:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:24:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-17 06:24:25,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-17 06:24:25,856 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 79 transitions. [2025-03-17 06:24:25,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 220 flow [2025-03-17 06:24:25,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:24:25,865 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-03-17 06:24:25,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-17 06:24:25,871 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-03-17 06:24:25,872 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-03-17 06:24:25,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:25,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:25,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:25,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:24:25,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash -687721105, now seen corresponding path program 1 times [2025-03-17 06:24:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-17 06:24:25,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:25,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:25,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:24:25,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:24:25,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:26,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-17 06:24:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965032409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:26,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:24:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170484190] [2025-03-17 06:24:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:26,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:24:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:26,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:24:26,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:24:26,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:26,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:26,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:26,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:26,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:27,153 INFO L124 PetriNetUnfolderBase]: 7135/10445 cut-off events. [2025-03-17 06:24:27,153 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-03-17 06:24:27,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21223 conditions, 10445 events. 7135/10445 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 58625 event pairs, 2001 based on Foata normal form. 0/10200 useless extension candidates. Maximal degree in co-relation 21213. Up to 6723 conditions per place. [2025-03-17 06:24:27,201 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 40 selfloop transitions, 3 changer transitions 70/117 dead transitions. [2025-03-17 06:24:27,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 484 flow [2025-03-17 06:24:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-17 06:24:27,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.534375 [2025-03-17 06:24:27,205 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 171 transitions. [2025-03-17 06:24:27,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 484 flow [2025-03-17 06:24:27,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 117 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:24:27,211 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 107 flow [2025-03-17 06:24:27,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-03-17 06:24:27,212 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-03-17 06:24:27,213 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 107 flow [2025-03-17 06:24:27,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:27,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:27,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:24:27,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:27,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash -406112820, now seen corresponding path program 1 times [2025-03-17 06:24:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-17 06:24:27,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:24:27,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:24:27,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:27,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-17 06:24:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:27,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:27,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:24:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428168890] [2025-03-17 06:24:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:27,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:24:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:24:27,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:24:27,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:27,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:27,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:27,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:27,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:28,785 INFO L124 PetriNetUnfolderBase]: 8035/11789 cut-off events. [2025-03-17 06:24:28,785 INFO L125 PetriNetUnfolderBase]: For 5359/5359 co-relation queries the response was YES. [2025-03-17 06:24:28,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27498 conditions, 11789 events. 8035/11789 cut-off events. For 5359/5359 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 67892 event pairs, 1241 based on Foata normal form. 360/12144 useless extension candidates. Maximal degree in co-relation 27483. Up to 5105 conditions per place. [2025-03-17 06:24:28,838 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 58 selfloop transitions, 5 changer transitions 81/148 dead transitions. [2025-03-17 06:24:28,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 148 transitions, 687 flow [2025-03-17 06:24:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:24:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:24:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2025-03-17 06:24:28,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-03-17 06:24:28,841 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 107 flow. Second operand 10 states and 215 transitions. [2025-03-17 06:24:28,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 148 transitions, 687 flow [2025-03-17 06:24:28,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 148 transitions, 664 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-17 06:24:28,911 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 164 flow [2025-03-17 06:24:28,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2025-03-17 06:24:28,912 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-03-17 06:24:28,912 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 164 flow [2025-03-17 06:24:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:28,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:28,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:24:28,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:28,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1989235787, now seen corresponding path program 1 times [2025-03-17 06:24:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438887187] [2025-03-17 06:24:28,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 06:24:28,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 06:24:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438887187] [2025-03-17 06:24:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438887187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:24:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332955174] [2025-03-17 06:24:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:29,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:24:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:29,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:24:29,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:24:29,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:29,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:29,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:29,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:29,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:29,593 INFO L124 PetriNetUnfolderBase]: 4979/7809 cut-off events. [2025-03-17 06:24:29,593 INFO L125 PetriNetUnfolderBase]: For 10182/10182 co-relation queries the response was YES. [2025-03-17 06:24:29,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 7809 events. 4979/7809 cut-off events. For 10182/10182 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 46736 event pairs, 885 based on Foata normal form. 372/8176 useless extension candidates. Maximal degree in co-relation 21075. Up to 3935 conditions per place. [2025-03-17 06:24:29,630 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 72 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2025-03-17 06:24:29,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 522 flow [2025-03-17 06:24:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:24:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:24:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-17 06:24:29,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-03-17 06:24:29,632 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 164 flow. Second operand 4 states and 101 transitions. [2025-03-17 06:24:29,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 522 flow [2025-03-17 06:24:29,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 492 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-17 06:24:29,657 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 182 flow [2025-03-17 06:24:29,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-03-17 06:24:29,658 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2025-03-17 06:24:29,658 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 182 flow [2025-03-17 06:24:29,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:29,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:29,658 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] [2025-03-17 06:24:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:24:29,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1874446222, now seen corresponding path program 1 times [2025-03-17 06:24:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-17 06:24:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:29,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 06:24:29,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 06:24:29,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:29,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-17 06:24:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160353192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:24:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318622845] [2025-03-17 06:24:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:24:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:24:29,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:24:29,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:29,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:29,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:29,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:30,232 INFO L124 PetriNetUnfolderBase]: 2961/4635 cut-off events. [2025-03-17 06:24:30,232 INFO L125 PetriNetUnfolderBase]: For 4921/4921 co-relation queries the response was YES. [2025-03-17 06:24:30,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13179 conditions, 4635 events. 2961/4635 cut-off events. For 4921/4921 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 24556 event pairs, 501 based on Foata normal form. 268/4898 useless extension candidates. Maximal degree in co-relation 13157. Up to 1554 conditions per place. [2025-03-17 06:24:30,249 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 86 selfloop transitions, 8 changer transitions 2/101 dead transitions. [2025-03-17 06:24:30,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 632 flow [2025-03-17 06:24:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:24:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:24:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-17 06:24:30,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.645 [2025-03-17 06:24:30,253 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 182 flow. Second operand 5 states and 129 transitions. [2025-03-17 06:24:30,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 632 flow [2025-03-17 06:24:30,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 622 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 06:24:30,259 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 222 flow [2025-03-17 06:24:30,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-03-17 06:24:30,261 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-03-17 06:24:30,262 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 222 flow [2025-03-17 06:24:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:30,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:30,264 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-03-17 06:24:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:24:30,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1591080536, now seen corresponding path program 1 times [2025-03-17 06:24:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256899183] [2025-03-17 06:24:30,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:24:30,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:24:30,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:30,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256899183] [2025-03-17 06:24:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256899183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454435917] [2025-03-17 06:24:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:24:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:24:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:24:30,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:30,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:30,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:30,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:30,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:31,119 INFO L124 PetriNetUnfolderBase]: 3851/5960 cut-off events. [2025-03-17 06:24:31,119 INFO L125 PetriNetUnfolderBase]: For 7979/7979 co-relation queries the response was YES. [2025-03-17 06:24:31,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18056 conditions, 5960 events. 3851/5960 cut-off events. For 7979/7979 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 31979 event pairs, 825 based on Foata normal form. 76/6034 useless extension candidates. Maximal degree in co-relation 18032. Up to 2690 conditions per place. [2025-03-17 06:24:31,198 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 96 selfloop transitions, 18 changer transitions 38/156 dead transitions. [2025-03-17 06:24:31,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 156 transitions, 1049 flow [2025-03-17 06:24:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:24:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:24:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2025-03-17 06:24:31,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2025-03-17 06:24:31,200 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 222 flow. Second operand 9 states and 193 transitions. [2025-03-17 06:24:31,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 156 transitions, 1049 flow [2025-03-17 06:24:31,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 156 transitions, 977 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-17 06:24:31,210 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 384 flow [2025-03-17 06:24:31,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2025-03-17 06:24:31,211 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2025-03-17 06:24:31,211 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 384 flow [2025-03-17 06:24:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:31,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:31,212 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-03-17 06:24:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:24:31,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1753796616, now seen corresponding path program 2 times [2025-03-17 06:24:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144252823] [2025-03-17 06:24:31,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:24:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:31,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:24:31,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:24:31,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:24:31,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144252823] [2025-03-17 06:24:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144252823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:31,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:24:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098857348] [2025-03-17 06:24:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:31,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:24:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:31,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:24:31,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:24:31,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:31,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:31,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:31,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:31,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:32,425 INFO L124 PetriNetUnfolderBase]: 4867/7516 cut-off events. [2025-03-17 06:24:32,426 INFO L125 PetriNetUnfolderBase]: For 14617/14617 co-relation queries the response was YES. [2025-03-17 06:24:32,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23740 conditions, 7516 events. 4867/7516 cut-off events. For 14617/14617 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 42081 event pairs, 1207 based on Foata normal form. 56/7570 useless extension candidates. Maximal degree in co-relation 23710. Up to 2980 conditions per place. [2025-03-17 06:24:32,474 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 100 selfloop transitions, 18 changer transitions 46/168 dead transitions. [2025-03-17 06:24:32,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 168 transitions, 1221 flow [2025-03-17 06:24:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-03-17 06:24:32,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-17 06:24:32,478 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 384 flow. Second operand 8 states and 190 transitions. [2025-03-17 06:24:32,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 168 transitions, 1221 flow [2025-03-17 06:24:32,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 168 transitions, 1181 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-17 06:24:32,515 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 393 flow [2025-03-17 06:24:32,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-03-17 06:24:32,516 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2025-03-17 06:24:32,516 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 393 flow [2025-03-17 06:24:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:32,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:32,516 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-03-17 06:24:32,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:24:32,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:32,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash -985422000, now seen corresponding path program 3 times [2025-03-17 06:24:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:32,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400386059] [2025-03-17 06:24:32,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:24:32,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:32,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:24:32,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:24:32,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:24:32,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400386059] [2025-03-17 06:24:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400386059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:24:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684702] [2025-03-17 06:24:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:24:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:32,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:24:32,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:24:32,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:32,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:32,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:32,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:33,085 INFO L124 PetriNetUnfolderBase]: 2535/3985 cut-off events. [2025-03-17 06:24:33,086 INFO L125 PetriNetUnfolderBase]: For 9756/9756 co-relation queries the response was YES. [2025-03-17 06:24:33,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12682 conditions, 3985 events. 2535/3985 cut-off events. For 9756/9756 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20969 event pairs, 469 based on Foata normal form. 156/4136 useless extension candidates. Maximal degree in co-relation 12651. Up to 1460 conditions per place. [2025-03-17 06:24:33,098 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 67 selfloop transitions, 11 changer transitions 29/112 dead transitions. [2025-03-17 06:24:33,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 983 flow [2025-03-17 06:24:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:24:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:24:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-17 06:24:33,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-03-17 06:24:33,099 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 393 flow. Second operand 6 states and 129 transitions. [2025-03-17 06:24:33,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 983 flow [2025-03-17 06:24:33,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 821 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-17 06:24:33,107 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 268 flow [2025-03-17 06:24:33,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-03-17 06:24:33,108 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-03-17 06:24:33,108 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 268 flow [2025-03-17 06:24:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:33,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:33,108 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-03-17 06:24:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:24:33,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1949276120, now seen corresponding path program 1 times [2025-03-17 06:24:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-03-17 06:24:33,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:33,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:24:33,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:24:33,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:33,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-03-17 06:24:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175278297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028311695] [2025-03-17 06:24:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:24:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:33,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:24:33,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:24:33,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:33,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:33,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:33,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:33,625 INFO L124 PetriNetUnfolderBase]: 1873/2981 cut-off events. [2025-03-17 06:24:33,626 INFO L125 PetriNetUnfolderBase]: For 5356/5356 co-relation queries the response was YES. [2025-03-17 06:24:33,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9334 conditions, 2981 events. 1873/2981 cut-off events. For 5356/5356 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14916 event pairs, 623 based on Foata normal form. 8/2986 useless extension candidates. Maximal degree in co-relation 9307. Up to 1594 conditions per place. [2025-03-17 06:24:33,636 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 39 selfloop transitions, 3 changer transitions 36/82 dead transitions. [2025-03-17 06:24:33,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 591 flow [2025-03-17 06:24:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:24:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:24:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2025-03-17 06:24:33,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-17 06:24:33,638 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 268 flow. Second operand 6 states and 104 transitions. [2025-03-17 06:24:33,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 591 flow [2025-03-17 06:24:33,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 470 flow, removed 26 selfloop flow, removed 10 redundant places. [2025-03-17 06:24:33,653 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 153 flow [2025-03-17 06:24:33,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2025-03-17 06:24:33,655 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2025-03-17 06:24:33,655 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 153 flow [2025-03-17 06:24:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:33,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:33,655 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-03-17 06:24:33,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:24:33,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:33,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash 463899642, now seen corresponding path program 2 times [2025-03-17 06:24:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:33,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-03-17 06:24:33,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:24:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:33,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:24:33,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:24:33,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:24:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-03-17 06:24:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230212157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:34,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:24:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118747088] [2025-03-17 06:24:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:24:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:34,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:24:34,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:24:34,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:34,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:34,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:34,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:34,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:34,539 INFO L124 PetriNetUnfolderBase]: 895/1453 cut-off events. [2025-03-17 06:24:34,539 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2025-03-17 06:24:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1453 events. 895/1453 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6090 event pairs, 196 based on Foata normal form. 8/1460 useless extension candidates. Maximal degree in co-relation 3681. Up to 564 conditions per place. [2025-03-17 06:24:34,544 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 57 selfloop transitions, 8 changer transitions 32/101 dead transitions. [2025-03-17 06:24:34,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 558 flow [2025-03-17 06:24:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:24:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:24:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2025-03-17 06:24:34,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-17 06:24:34,545 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 153 flow. Second operand 10 states and 152 transitions. [2025-03-17 06:24:34,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 558 flow [2025-03-17 06:24:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 494 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-03-17 06:24:34,548 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 162 flow [2025-03-17 06:24:34,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=162, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-03-17 06:24:34,549 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-03-17 06:24:34,549 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 162 flow [2025-03-17 06:24:34,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:34,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:34,549 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-03-17 06:24:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:24:34,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -434871870, now seen corresponding path program 3 times [2025-03-17 06:24:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-03-17 06:24:34,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:24:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:34,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:24:34,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:24:34,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:24:34,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:24:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-03-17 06:24:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227614896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:24:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648942158] [2025-03-17 06:24:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:24:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:24:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:24:35,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:35,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 162 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:35,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:35,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:35,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:35,892 INFO L124 PetriNetUnfolderBase]: 763/1249 cut-off events. [2025-03-17 06:24:35,892 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2025-03-17 06:24:35,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 1249 events. 763/1249 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4980 event pairs, 240 based on Foata normal form. 8/1256 useless extension candidates. Maximal degree in co-relation 3181. Up to 744 conditions per place. [2025-03-17 06:24:35,897 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 44 selfloop transitions, 5 changer transitions 33/86 dead transitions. [2025-03-17 06:24:35,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 460 flow [2025-03-17 06:24:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:24:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:24:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-03-17 06:24:35,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2025-03-17 06:24:35,898 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 162 flow. Second operand 9 states and 131 transitions. [2025-03-17 06:24:35,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 460 flow [2025-03-17 06:24:35,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 439 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-17 06:24:35,901 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 156 flow [2025-03-17 06:24:35,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2025-03-17 06:24:35,902 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-03-17 06:24:35,903 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 156 flow [2025-03-17 06:24:35,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:35,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:35,903 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-03-17 06:24:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:24:35,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:24:35,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 397591522, now seen corresponding path program 4 times [2025-03-17 06:24:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239655280] [2025-03-17 06:24:35,904 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:24:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:35,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:24:35,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:24:35,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:24:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:24:35,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:24:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:24:35,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:24:35,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:24:35,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:24:35,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:24:35,993 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:24:35,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:24:35,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 06:24:35,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 06:24:35,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 06:24:35,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:24:35,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:24:35,996 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2025-03-17 06:24:36,066 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:24:36,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:24:36,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:24:36 BasicIcfg [2025-03-17 06:24:36,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:24:36,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:24:36,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:24:36,070 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:24:36,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:24:24" (3/4) ... [2025-03-17 06:24:36,071 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:24:36,139 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 06:24:36,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:24:36,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:24:36,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:24:36,175 INFO L158 Benchmark]: Toolchain (without parser) took 13010.35ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.7MB in the beginning and 538.0MB in the end (delta: -433.3MB). Peak memory consumption was 708.0MB. Max. memory is 16.1GB. [2025-03-17 06:24:36,176 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:24:36,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.48ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.9MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:24:36,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.76ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:24:36,177 INFO L158 Benchmark]: Boogie Preprocessor took 47.99ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:24:36,177 INFO L158 Benchmark]: IcfgBuilder took 616.39ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 93.5MB in the end (delta: -17.0MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-03-17 06:24:36,177 INFO L158 Benchmark]: TraceAbstraction took 11754.66ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.8MB in the beginning and 554.8MB in the end (delta: -462.0MB). Peak memory consumption was 677.0MB. Max. memory is 16.1GB. [2025-03-17 06:24:36,178 INFO L158 Benchmark]: Witness Printer took 103.66ms. Allocated memory is still 1.3GB. Free memory was 554.8MB in the beginning and 538.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:24:36,180 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.48ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.9MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.76ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.99ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 616.39ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 93.5MB in the end (delta: -17.0MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11754.66ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.8MB in the beginning and 554.8MB in the end (delta: -462.0MB). Peak memory consumption was 677.0MB. Max. memory is 16.1GB. * Witness Printer took 103.66ms. Allocated memory is still 1.3GB. Free memory was 554.8MB in the beginning and 538.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-1, t667=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-1, t667=0, t668=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-1, t667=0, t668=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-1, t667=0, t668=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-1, t667=0, t668=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 63 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 826 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 820 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2228 IncrementalHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 11 mSDtfsCounter, 2228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=7, InterpolantAutomatonStates: 78, 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, 3.2s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 06:24:36,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE