./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix028_power.opt_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/mix028_power.opt_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 a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:24:42,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:24:42,116 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:42,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:24:42,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:24:42,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:24:42,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:24:42,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:24:42,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:24:42,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:24:42,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:24:42,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:24:42,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:24:42,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:24:42,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:24:42,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:24:42,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:24:42,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:24:42,147 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 -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2025-03-17 06:24:42,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:24:42,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:24:42,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:24:42,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:24:42,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:24:42,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2025-03-17 06:24:43,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3cba86e/2b06825b8dee4ca7bced82f838d7526c/FLAG9b46600d7 [2025-03-17 06:24:43,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:24:43,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2025-03-17 06:24:43,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3cba86e/2b06825b8dee4ca7bced82f838d7526c/FLAG9b46600d7 [2025-03-17 06:24:44,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3cba86e/2b06825b8dee4ca7bced82f838d7526c [2025-03-17 06:24:44,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:24:44,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:24:44,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:24:44,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:24:44,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:24:44,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:24:44" (1/1) ... [2025-03-17 06:24:44,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb352ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:44, skipping insertion in model container [2025-03-17 06:24:44,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:24:44" (1/1) ... [2025-03-17 06:24:44,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:24:44,298 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2025-03-17 06:24:44,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:24:44,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:24:44,423 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2025-03-17 06:24:44,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:24:44,496 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:24:44,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:44 WrapperNode [2025-03-17 06:24:44,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:24:44,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:24:44,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:24:44,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:24:44,503 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:44" (1/1) ... [2025-03-17 06:24:44,517 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:44" (1/1) ... [2025-03-17 06:24:44,536 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-03-17 06:24:44,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:24:44,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:24:44,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:24:44,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:24:44,544 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:44" (1/1) ... [2025-03-17 06:24:44,544 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:44" (1/1) ... [2025-03-17 06:24:44,547 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:44" (1/1) ... [2025-03-17 06:24:44,561 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:44,561 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:44" (1/1) ... [2025-03-17 06:24:44,561 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:44" (1/1) ... [2025-03-17 06:24:44,567 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:44" (1/1) ... [2025-03-17 06:24:44,568 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:44" (1/1) ... [2025-03-17 06:24:44,569 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:44" (1/1) ... [2025-03-17 06:24:44,570 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:44" (1/1) ... [2025-03-17 06:24:44,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:24:44,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:24:44,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:24:44,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:24:44,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:44" (1/1) ... [2025-03-17 06:24:44,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:24:44,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:24:44,601 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:44,606 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:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:24:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:24:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 06:24:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 06:24:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 06:24:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 06:24:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 06:24:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 06:24:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:24:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:24:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:24:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:24:44,624 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:44,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:24:44,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:24:44,986 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:24:44,986 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:24:45,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:24:45,160 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:24:45,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:24:45 BoogieIcfgContainer [2025-03-17 06:24:45,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:24:45,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:24:45,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:24:45,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:24:45,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:24:44" (1/3) ... [2025-03-17 06:24:45,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614526e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:24:45, skipping insertion in model container [2025-03-17 06:24:45,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:24:44" (2/3) ... [2025-03-17 06:24:45,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614526e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:24:45, skipping insertion in model container [2025-03-17 06:24:45,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:24:45" (3/3) ... [2025-03-17 06:24:45,170 INFO L128 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2025-03-17 06:24:45,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:24:45,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix028_power.opt_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:45,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:24:45,245 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:24:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-03-17 06:24:45,297 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-03-17 06:24:45,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:24:45,301 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 69 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:45,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-03-17 06:24:45,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-03-17 06:24:45,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:24:45,319 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;@6d11bc86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:24:45,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:24:45,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:24:45,323 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-17 06:24:45,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:24:45,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:45,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 06:24:45,323 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:45,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2035242413, now seen corresponding path program 1 times [2025-03-17 06:24:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722497977] [2025-03-17 06:24:45,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:45,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 06:24:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 06:24:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:45,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:45,743 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:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722497977] [2025-03-17 06:24:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722497977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 06:24:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470435251] [2025-03-17 06:24:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:24:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:45,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:24:45,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:24:45,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:45,775 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:45,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:45,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:45,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:46,727 INFO L124 PetriNetUnfolderBase]: 4967/7164 cut-off events. [2025-03-17 06:24:46,727 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 06:24:46,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14323 conditions, 7164 events. 4967/7164 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 39187 event pairs, 547 based on Foata normal form. 246/7369 useless extension candidates. Maximal degree in co-relation 14312. Up to 6161 conditions per place. [2025-03-17 06:24:46,778 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-03-17 06:24:46,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 220 flow [2025-03-17 06:24:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:24:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:24:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-17 06:24:46,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-17 06:24:46,790 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:46,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 220 flow [2025-03-17 06:24:46,794 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:46,796 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-03-17 06:24:46,797 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:46,802 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-03-17 06:24:46,802 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-03-17 06:24:46,803 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:46,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:46,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:24:46,804 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:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1338610872, now seen corresponding path program 1 times [2025-03-17 06:24:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387034924] [2025-03-17 06:24:46,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:46,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:24:46,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:24:46,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:46,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:47,178 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:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:47,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387034924] [2025-03-17 06:24:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387034924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:47,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:47,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:24:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839128888] [2025-03-17 06:24:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:47,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:24:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:47,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:24:47,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:24:47,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:47,184 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:47,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:47,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:47,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:48,061 INFO L124 PetriNetUnfolderBase]: 6563/9573 cut-off events. [2025-03-17 06:24:48,062 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-03-17 06:24:48,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19515 conditions, 9573 events. 6563/9573 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 52374 event pairs, 1271 based on Foata normal form. 0/9381 useless extension candidates. Maximal degree in co-relation 19505. Up to 4993 conditions per place. [2025-03-17 06:24:48,097 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 2 changer transitions 72/119 dead transitions. [2025-03-17 06:24:48,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 119 transitions, 490 flow [2025-03-17 06:24:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-03-17 06:24:48,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.540625 [2025-03-17 06:24:48,099 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 173 transitions. [2025-03-17 06:24:48,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 119 transitions, 490 flow [2025-03-17 06:24:48,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:24:48,103 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2025-03-17 06:24:48,103 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-03-17 06:24:48,104 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-03-17 06:24:48,104 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2025-03-17 06:24:48,104 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:48,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:48,104 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:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:24:48,105 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:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2130534832, now seen corresponding path program 1 times [2025-03-17 06:24:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364251181] [2025-03-17 06:24:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:48,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 06:24:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 06:24:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:48,588 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:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364251181] [2025-03-17 06:24:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364251181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:24:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280021633] [2025-03-17 06:24:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:24:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:48,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:24:48,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:24:48,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:48,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:48,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:48,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:48,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:49,371 INFO L124 PetriNetUnfolderBase]: 5025/7415 cut-off events. [2025-03-17 06:24:49,372 INFO L125 PetriNetUnfolderBase]: For 1736/1736 co-relation queries the response was YES. [2025-03-17 06:24:49,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 7415 events. 5025/7415 cut-off events. For 1736/1736 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 40853 event pairs, 1491 based on Foata normal form. 180/7592 useless extension candidates. Maximal degree in co-relation 16315. Up to 5998 conditions per place. [2025-03-17 06:24:49,403 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 43 selfloop transitions, 3 changer transitions 45/95 dead transitions. [2025-03-17 06:24:49,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 411 flow [2025-03-17 06:24:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:24:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:24:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-03-17 06:24:49,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-17 06:24:49,406 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 7 states and 142 transitions. [2025-03-17 06:24:49,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 411 flow [2025-03-17 06:24:49,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 389 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 06:24:49,442 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 111 flow [2025-03-17 06:24:49,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-03-17 06:24:49,443 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2025-03-17 06:24:49,443 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 111 flow [2025-03-17 06:24:49,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:49,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:49,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:49,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:24:49,445 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:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1382039904, now seen corresponding path program 1 times [2025-03-17 06:24:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967472289] [2025-03-17 06:24:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:24:49,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:24:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:50,144 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:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967472289] [2025-03-17 06:24:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967472289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:50,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433983160] [2025-03-17 06:24:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:50,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:24:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:50,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:24:50,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:24:50,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:50,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:50,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:50,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:50,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:51,191 INFO L124 PetriNetUnfolderBase]: 6253/9135 cut-off events. [2025-03-17 06:24:51,192 INFO L125 PetriNetUnfolderBase]: For 5660/5660 co-relation queries the response was YES. [2025-03-17 06:24:51,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22393 conditions, 9135 events. 6253/9135 cut-off events. For 5660/5660 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 50017 event pairs, 904 based on Foata normal form. 214/9346 useless extension candidates. Maximal degree in co-relation 22377. Up to 6232 conditions per place. [2025-03-17 06:24:51,229 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 58 selfloop transitions, 12 changer transitions 55/129 dead transitions. [2025-03-17 06:24:51,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 129 transitions, 639 flow [2025-03-17 06:24:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-17 06:24:51,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571875 [2025-03-17 06:24:51,231 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 111 flow. Second operand 8 states and 183 transitions. [2025-03-17 06:24:51,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 129 transitions, 639 flow [2025-03-17 06:24:51,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 129 transitions, 624 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-17 06:24:51,255 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 226 flow [2025-03-17 06:24:51,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-03-17 06:24:51,256 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2025-03-17 06:24:51,257 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 226 flow [2025-03-17 06:24:51,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:51,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:51,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:51,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:24:51,258 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:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2026347232, now seen corresponding path program 2 times [2025-03-17 06:24:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:51,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982314553] [2025-03-17 06:24:51,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:24:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:51,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:24:51,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:24:51,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:24:51,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:51,824 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:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982314553] [2025-03-17 06:24:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982314553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210032948] [2025-03-17 06:24:51,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:51,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:24:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:24:51,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:24:51,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:51,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:51,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:51,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:51,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:52,786 INFO L124 PetriNetUnfolderBase]: 6107/8971 cut-off events. [2025-03-17 06:24:52,786 INFO L125 PetriNetUnfolderBase]: For 16804/16807 co-relation queries the response was YES. [2025-03-17 06:24:52,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30769 conditions, 8971 events. 6107/8971 cut-off events. For 16804/16807 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 48467 event pairs, 2208 based on Foata normal form. 182/9150 useless extension candidates. Maximal degree in co-relation 30748. Up to 7219 conditions per place. [2025-03-17 06:24:52,893 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 66 selfloop transitions, 10 changer transitions 55/135 dead transitions. [2025-03-17 06:24:52,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 135 transitions, 969 flow [2025-03-17 06:24:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2025-03-17 06:24:52,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.490625 [2025-03-17 06:24:52,898 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 226 flow. Second operand 8 states and 157 transitions. [2025-03-17 06:24:52,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 135 transitions, 969 flow [2025-03-17 06:24:52,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 135 transitions, 956 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-17 06:24:52,921 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 352 flow [2025-03-17 06:24:52,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=352, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-03-17 06:24:52,923 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2025-03-17 06:24:52,923 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 352 flow [2025-03-17 06:24:52,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:52,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:52,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:52,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:24:52,926 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:52,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1256038218, now seen corresponding path program 3 times [2025-03-17 06:24:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617188967] [2025-03-17 06:24:52,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:24:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:52,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:24:52,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:24:52,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:24:52,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:53,553 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:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617188967] [2025-03-17 06:24:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617188967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:24:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568505877] [2025-03-17 06:24:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:53,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:24:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:53,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:24:53,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:24:53,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:53,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 352 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:53,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:53,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:54,671 INFO L124 PetriNetUnfolderBase]: 6151/8993 cut-off events. [2025-03-17 06:24:54,672 INFO L125 PetriNetUnfolderBase]: For 30255/30258 co-relation queries the response was YES. [2025-03-17 06:24:54,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35968 conditions, 8993 events. 6151/8993 cut-off events. For 30255/30258 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48340 event pairs, 1874 based on Foata normal form. 182/9172 useless extension candidates. Maximal degree in co-relation 35940. Up to 6293 conditions per place. [2025-03-17 06:24:54,724 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 88 selfloop transitions, 39 changer transitions 73/204 dead transitions. [2025-03-17 06:24:54,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 204 transitions, 1743 flow [2025-03-17 06:24:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:24:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 06:24:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 246 transitions. [2025-03-17 06:24:54,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-03-17 06:24:54,726 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 352 flow. Second operand 12 states and 246 transitions. [2025-03-17 06:24:54,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 204 transitions, 1743 flow [2025-03-17 06:24:54,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 204 transitions, 1699 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-17 06:24:54,768 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 830 flow [2025-03-17 06:24:54,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=830, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-03-17 06:24:54,769 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2025-03-17 06:24:54,769 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 830 flow [2025-03-17 06:24:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:54,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:54,769 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:54,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:24:54,769 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:54,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -692505545, now seen corresponding path program 1 times [2025-03-17 06:24:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205982401] [2025-03-17 06:24:54,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:54,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 06:24:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 06:24:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:55,064 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:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205982401] [2025-03-17 06:24:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205982401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546739691] [2025-03-17 06:24:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:55,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:24:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:55,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:24:55,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:24:55,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:55,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:55,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:55,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:55,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:56,290 INFO L124 PetriNetUnfolderBase]: 5965/8675 cut-off events. [2025-03-17 06:24:56,291 INFO L125 PetriNetUnfolderBase]: For 48610/48616 co-relation queries the response was YES. [2025-03-17 06:24:56,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41004 conditions, 8675 events. 5965/8675 cut-off events. For 48610/48616 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 46289 event pairs, 967 based on Foata normal form. 146/8817 useless extension candidates. Maximal degree in co-relation 40967. Up to 6941 conditions per place. [2025-03-17 06:24:56,363 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 16 changer transitions 62/189 dead transitions. [2025-03-17 06:24:56,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 189 transitions, 2005 flow [2025-03-17 06:24:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:24:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:24:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2025-03-17 06:24:56,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-17 06:24:56,368 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 830 flow. Second operand 10 states and 192 transitions. [2025-03-17 06:24:56,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 189 transitions, 2005 flow [2025-03-17 06:24:56,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 189 transitions, 1881 flow, removed 62 selfloop flow, removed 2 redundant places. [2025-03-17 06:24:56,561 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 913 flow [2025-03-17 06:24:56,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=913, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2025-03-17 06:24:56,562 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2025-03-17 06:24:56,562 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 913 flow [2025-03-17 06:24:56,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:24:56,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:56,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:56,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:24:56,562 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:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 728929730, now seen corresponding path program 1 times [2025-03-17 06:24:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001398135] [2025-03-17 06:24:56,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:24:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:24:56,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:56,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:57,010 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:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001398135] [2025-03-17 06:24:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001398135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:24:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026807793] [2025-03-17 06:24:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:24:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:57,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:24:57,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:24:57,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:57,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 913 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:57,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:57,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:57,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:58,014 INFO L124 PetriNetUnfolderBase]: 5743/8414 cut-off events. [2025-03-17 06:24:58,015 INFO L125 PetriNetUnfolderBase]: For 53518/53524 co-relation queries the response was YES. [2025-03-17 06:24:58,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40607 conditions, 8414 events. 5743/8414 cut-off events. For 53518/53524 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44385 event pairs, 1045 based on Foata normal form. 124/8535 useless extension candidates. Maximal degree in co-relation 40563. Up to 6887 conditions per place. [2025-03-17 06:24:58,064 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 109 selfloop transitions, 11 changer transitions 49/173 dead transitions. [2025-03-17 06:24:58,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 173 transitions, 1876 flow [2025-03-17 06:24:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:24:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:24:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2025-03-17 06:24:58,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 06:24:58,066 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 913 flow. Second operand 8 states and 160 transitions. [2025-03-17 06:24:58,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 173 transitions, 1876 flow [2025-03-17 06:24:58,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 173 transitions, 1752 flow, removed 57 selfloop flow, removed 11 redundant places. [2025-03-17 06:24:58,178 INFO L231 Difference]: Finished difference. Result has 83 places, 90 transitions, 886 flow [2025-03-17 06:24:58,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=886, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2025-03-17 06:24:58,178 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2025-03-17 06:24:58,178 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 886 flow [2025-03-17 06:24:58,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:58,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:58,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:24:58,179 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:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1258730529, now seen corresponding path program 1 times [2025-03-17 06:24:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238481509] [2025-03-17 06:24:58,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:24:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:58,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:24:58,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:24:58,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:24:58,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:58,417 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:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238481509] [2025-03-17 06:24:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238481509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:24:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374950155] [2025-03-17 06:24:58,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:58,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:24:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:58,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:24:58,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:24:58,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:24:58,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:58,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:58,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:24:58,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:24:59,632 INFO L124 PetriNetUnfolderBase]: 7999/11650 cut-off events. [2025-03-17 06:24:59,632 INFO L125 PetriNetUnfolderBase]: For 58673/58679 co-relation queries the response was YES. [2025-03-17 06:24:59,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52741 conditions, 11650 events. 7999/11650 cut-off events. For 58673/58679 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 65236 event pairs, 1308 based on Foata normal form. 120/11766 useless extension candidates. Maximal degree in co-relation 52701. Up to 5638 conditions per place. [2025-03-17 06:24:59,688 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 118 selfloop transitions, 13 changer transitions 46/181 dead transitions. [2025-03-17 06:24:59,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 181 transitions, 1969 flow [2025-03-17 06:24:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:24:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:24:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-17 06:24:59,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-03-17 06:24:59,690 INFO L175 Difference]: Start difference. First operand has 83 places, 90 transitions, 886 flow. Second operand 6 states and 133 transitions. [2025-03-17 06:24:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 181 transitions, 1969 flow [2025-03-17 06:24:59,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 181 transitions, 1914 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-17 06:24:59,802 INFO L231 Difference]: Finished difference. Result has 81 places, 97 transitions, 982 flow [2025-03-17 06:24:59,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=982, PETRI_PLACES=81, PETRI_TRANSITIONS=97} [2025-03-17 06:24:59,802 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2025-03-17 06:24:59,802 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 97 transitions, 982 flow [2025-03-17 06:24:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:59,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:24:59,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:24:59,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:24:59,803 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:59,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:24:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash -857737305, now seen corresponding path program 2 times [2025-03-17 06:24:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:24:59,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598322416] [2025-03-17 06:24:59,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:24:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:24:59,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:24:59,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:24:59,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:24:59,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:24:59,881 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:59,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:24:59,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598322416] [2025-03-17 06:24:59,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598322416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:24:59,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:24:59,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:24:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061802283] [2025-03-17 06:24:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:24:59,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:24:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:24:59,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:24:59,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:24:59,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:24:59,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 97 transitions, 982 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:59,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:24:59,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:24:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:25:00,568 INFO L124 PetriNetUnfolderBase]: 5948/9174 cut-off events. [2025-03-17 06:25:00,568 INFO L125 PetriNetUnfolderBase]: For 50137/50179 co-relation queries the response was YES. [2025-03-17 06:25:00,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38996 conditions, 9174 events. 5948/9174 cut-off events. For 50137/50179 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 54844 event pairs, 860 based on Foata normal form. 474/9638 useless extension candidates. Maximal degree in co-relation 38957. Up to 4415 conditions per place. [2025-03-17 06:25:00,612 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 121 selfloop transitions, 5 changer transitions 7/138 dead transitions. [2025-03-17 06:25:00,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 138 transitions, 1569 flow [2025-03-17 06:25:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:25:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:25:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-17 06:25:00,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-03-17 06:25:00,616 INFO L175 Difference]: Start difference. First operand has 81 places, 97 transitions, 982 flow. Second operand 4 states and 101 transitions. [2025-03-17 06:25:00,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 138 transitions, 1569 flow [2025-03-17 06:25:00,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 1497 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 06:25:00,670 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 734 flow [2025-03-17 06:25:00,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-03-17 06:25:00,671 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2025-03-17 06:25:00,671 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 734 flow [2025-03-17 06:25:00,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:25:00,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:25:00,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:25:00,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:25:00,671 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:25:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:25:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1288270010, now seen corresponding path program 1 times [2025-03-17 06:25:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:25:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401706387] [2025-03-17 06:25:00,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:25:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:25:00,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:25:00,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:25:00,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:25:00,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:25:00,784 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:25:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:25:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401706387] [2025-03-17 06:25:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401706387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:25:00,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:25:00,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:25:00,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923561037] [2025-03-17 06:25:00,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:25:00,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:25:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:25:00,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:25:00,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:25:00,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:25:00,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 734 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:25:00,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:25:00,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:25:00,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:25:01,402 INFO L124 PetriNetUnfolderBase]: 3515/5446 cut-off events. [2025-03-17 06:25:01,402 INFO L125 PetriNetUnfolderBase]: For 24371/24398 co-relation queries the response was YES. [2025-03-17 06:25:01,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22580 conditions, 5446 events. 3515/5446 cut-off events. For 24371/24398 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 29518 event pairs, 469 based on Foata normal form. 316/5756 useless extension candidates. Maximal degree in co-relation 22544. Up to 1923 conditions per place. [2025-03-17 06:25:01,433 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 122 selfloop transitions, 8 changer transitions 9/144 dead transitions. [2025-03-17 06:25:01,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 1528 flow [2025-03-17 06:25:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:25:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:25:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-17 06:25:01,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.645 [2025-03-17 06:25:01,434 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 734 flow. Second operand 5 states and 129 transitions. [2025-03-17 06:25:01,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 1528 flow [2025-03-17 06:25:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 144 transitions, 1516 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 06:25:01,459 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 736 flow [2025-03-17 06:25:01,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=736, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-03-17 06:25:01,459 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2025-03-17 06:25:01,459 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 736 flow [2025-03-17 06:25:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:25:01,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:25:01,460 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:25:01,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:25:01,460 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:25:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:25:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1932621135, now seen corresponding path program 1 times [2025-03-17 06:25:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:25:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574169652] [2025-03-17 06:25:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:25:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:25:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:25:01,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:25:01,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:25:01,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:25:01,606 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:25:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:25:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574169652] [2025-03-17 06:25:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574169652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:25:01,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:25:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:25:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655069675] [2025-03-17 06:25:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:25:01,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:25:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:25:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:25:01,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:25:01,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-17 06:25:01,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 736 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:25:01,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:25:01,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-17 06:25:01,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:25:02,003 INFO L124 PetriNetUnfolderBase]: 2304/3537 cut-off events. [2025-03-17 06:25:02,004 INFO L125 PetriNetUnfolderBase]: For 17143/17170 co-relation queries the response was YES. [2025-03-17 06:25:02,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15392 conditions, 3537 events. 2304/3537 cut-off events. For 17143/17170 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17684 event pairs, 372 based on Foata normal form. 114/3645 useless extension candidates. Maximal degree in co-relation 15354. Up to 1314 conditions per place. [2025-03-17 06:25:02,025 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 79 selfloop transitions, 11 changer transitions 36/131 dead transitions. [2025-03-17 06:25:02,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 1367 flow [2025-03-17 06:25:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:25:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:25:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-17 06:25:02,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-03-17 06:25:02,026 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 736 flow. Second operand 6 states and 129 transitions. [2025-03-17 06:25:02,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 1367 flow [2025-03-17 06:25:02,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 1298 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-17 06:25:02,058 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 465 flow [2025-03-17 06:25:02,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2025-03-17 06:25:02,058 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2025-03-17 06:25:02,060 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 465 flow [2025-03-17 06:25:02,060 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:25:02,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:25:02,060 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:25:02,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:25:02,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:25:02,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:25:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 967069057, now seen corresponding path program 1 times [2025-03-17 06:25:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:25:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304433257] [2025-03-17 06:25:02,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:25:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:25:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:25:02,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:25:02,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:25:02,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:25:02,483 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:25:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:25:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304433257] [2025-03-17 06:25:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304433257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:25:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:25:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:25:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125547361] [2025-03-17 06:25:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:25:02,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:25:02,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:25:02,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:25:02,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:25:02,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:25:02,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:25:02,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:25:02,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:25:02,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:25:02,923 INFO L124 PetriNetUnfolderBase]: 1289/2020 cut-off events. [2025-03-17 06:25:02,924 INFO L125 PetriNetUnfolderBase]: For 7415/7415 co-relation queries the response was YES. [2025-03-17 06:25:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8439 conditions, 2020 events. 1289/2020 cut-off events. For 7415/7415 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8434 event pairs, 233 based on Foata normal form. 8/2026 useless extension candidates. Maximal degree in co-relation 8402. Up to 1181 conditions per place. [2025-03-17 06:25:02,932 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 51 selfloop transitions, 6 changer transitions 65/126 dead transitions. [2025-03-17 06:25:02,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 1162 flow [2025-03-17 06:25:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:25:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:25:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-03-17 06:25:02,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44375 [2025-03-17 06:25:02,933 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 465 flow. Second operand 8 states and 142 transitions. [2025-03-17 06:25:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 1162 flow [2025-03-17 06:25:02,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 126 transitions, 842 flow, removed 89 selfloop flow, removed 19 redundant places. [2025-03-17 06:25:02,949 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 229 flow [2025-03-17 06:25:02,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2025-03-17 06:25:02,950 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2025-03-17 06:25:02,950 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 229 flow [2025-03-17 06:25:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:25:02,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:25:02,950 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:25:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:25:02,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:25:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:25:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1916071423, now seen corresponding path program 2 times [2025-03-17 06:25:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:25:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574628768] [2025-03-17 06:25:02,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:25:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:25:02,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:25:02,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:25:02,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:25:02,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:25:03,557 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:25:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:25:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574628768] [2025-03-17 06:25:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574628768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:25:03,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:25:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:25:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923100415] [2025-03-17 06:25:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:25:03,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:25:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:25:03,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:25:03,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:25:03,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-17 06:25:03,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 229 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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:25:03,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:25:03,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-17 06:25:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:25:03,827 INFO L124 PetriNetUnfolderBase]: 1062/1712 cut-off events. [2025-03-17 06:25:03,828 INFO L125 PetriNetUnfolderBase]: For 1372/1372 co-relation queries the response was YES. [2025-03-17 06:25:03,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 1712 events. 1062/1712 cut-off events. For 1372/1372 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7402 event pairs, 274 based on Foata normal form. 8/1720 useless extension candidates. Maximal degree in co-relation 4849. Up to 926 conditions per place. [2025-03-17 06:25:03,832 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 54 selfloop transitions, 10 changer transitions 15/83 dead transitions. [2025-03-17 06:25:03,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 512 flow [2025-03-17 06:25:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:25:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:25:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-17 06:25:03,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-17 06:25:03,834 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 229 flow. Second operand 7 states and 110 transitions. [2025-03-17 06:25:03,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 512 flow [2025-03-17 06:25:03,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 480 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-17 06:25:03,836 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 254 flow [2025-03-17 06:25:03,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2025-03-17 06:25:03,837 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2025-03-17 06:25:03,837 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 254 flow [2025-03-17 06:25:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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:25:03,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:25:03,837 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:25:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:25:03,837 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:25:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:25:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1424131151, now seen corresponding path program 3 times [2025-03-17 06:25:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:25:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296045827] [2025-03-17 06:25:03,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:25:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:25:03,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:25:03,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:25:03,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:25:03,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:25:03,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:25:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:25:03,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:25:03,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:25:03,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:25:03,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:25:03,934 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:25:03,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:25:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:25:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 06:25:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 06:25:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 06:25:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:25:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:25:03,937 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:25:03,996 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:25:03,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:25:03,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:25:03 BasicIcfg [2025-03-17 06:25:04,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:25:04,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:25:04,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:25:04,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:25:04,001 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:45" (3/4) ... [2025-03-17 06:25:04,001 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:25:04,077 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 06:25:04,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:25:04,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:25:04,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:25:04,115 INFO L158 Benchmark]: Toolchain (without parser) took 19961.82ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.5MB in the beginning and 1.0GB in the end (delta: -876.6MB). Peak memory consumption was 336.6MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,116 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:25:04,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.34ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 104.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.75ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 101.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:25:04,116 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 98.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,117 INFO L158 Benchmark]: IcfgBuilder took 587.83ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 47.1MB in the end (delta: 51.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,117 INFO L158 Benchmark]: TraceAbstraction took 18836.23ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 46.6MB in the beginning and 1.0GB in the end (delta: -970.0MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,117 INFO L158 Benchmark]: Witness Printer took 113.36ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:25:04,118 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.34ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 104.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.75ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 101.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 98.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 587.83ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 47.1MB in the end (delta: 51.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18836.23ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 46.6MB in the beginning and 1.0GB in the end (delta: -970.0MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. * Witness Printer took 113.36ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-3, 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] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-3, t749=-2, 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] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-3, t749=-2, t750=-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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L746] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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_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=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __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=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L801] 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) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 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_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-3, t749=-2, t750=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-3, t749=-2, t750=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-3, t749=-2, t750=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_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=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __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=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 824]: 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: 18.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2843 IncrementalHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 10 mSDtfsCounter, 2843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=982occurred in iteration=9, InterpolantAutomatonStates: 100, 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, 5.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:25:04,134 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