./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:10:33,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:10:33,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:10:33,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:10:33,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:10:33,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:10:33,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:10:33,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:10:33,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:10:33,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:10:33,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:10:33,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:10:33,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:10:33,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:10:33,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:10:33,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:10:33,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:10:33,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:10:33,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:10:33,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:10:33,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:10:33,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:10:33,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:10:33,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:10:33,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:10:33,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:10:33,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:10:33,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:10:33,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:10:33,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:10:33,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:10:33,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:10:33,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:10:33,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:10:33,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:10:33,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:10:33,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:10:33,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:10:33,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:10:33,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:10:33,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:10:33,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:10:33,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-10-11 14:10:33,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:10:33,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:10:33,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:10:33,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:10:33,444 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:10:33,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-11 14:10:34,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:10:35,122 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:10:35,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-11 14:10:35,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/940c271ea/5013100b4ac942caa7786d8b5a98ab6d/FLAG102cf72f5 [2024-10-11 14:10:35,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/940c271ea/5013100b4ac942caa7786d8b5a98ab6d [2024-10-11 14:10:35,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:10:35,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:10:35,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:10:35,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:10:35,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:10:35,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:35,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb86d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35, skipping insertion in model container [2024-10-11 14:10:35,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:35,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:10:35,802 WARN L248 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-atomic/read_write_lock-2.i[31244,31257] [2024-10-11 14:10:35,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:10:35,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:10:35,886 WARN L248 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-atomic/read_write_lock-2.i[31244,31257] [2024-10-11 14:10:35,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:10:35,938 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:10:35,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35 WrapperNode [2024-10-11 14:10:35,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:10:35,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:10:35,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:10:35,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:10:35,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:35,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:35,983 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2024-10-11 14:10:35,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:10:35,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:10:35,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:10:35,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:10:35,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:35,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,016 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]. [2024-10-11 14:10:36,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:10:36,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:10:36,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:10:36,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:10:36,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (1/1) ... [2024-10-11 14:10:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:10:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:36,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:10:36,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:10:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:10:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:10:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-11 14:10:36,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-11 14:10:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:10:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:10:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:10:36,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:10:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-11 14:10:36,121 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-11 14:10:36,122 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:10:36,264 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:10:36,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:10:36,430 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:10:36,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:10:36,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:10:36,554 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:10:36,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:36 BoogieIcfgContainer [2024-10-11 14:10:36,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:10:36,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:10:36,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:10:36,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:10:36,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:10:35" (1/3) ... [2024-10-11 14:10:36,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd5a32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:10:36, skipping insertion in model container [2024-10-11 14:10:36,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:10:35" (2/3) ... [2024-10-11 14:10:36,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd5a32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:10:36, skipping insertion in model container [2024-10-11 14:10:36,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:36" (3/3) ... [2024-10-11 14:10:36,566 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-11 14:10:36,583 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:10:36,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:10:36,584 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:10:36,644 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 14:10:36,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 136 flow [2024-10-11 14:10:36,713 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-10-11 14:10:36,713 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:10:36,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 2/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-10-11 14:10:36,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 136 flow [2024-10-11 14:10:36,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 48 transitions, 117 flow [2024-10-11 14:10:36,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:10:36,733 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;@5d1ca7a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:10:36,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:10:36,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:10:36,748 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2024-10-11 14:10:36,748 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:10:36,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:36,749 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:36,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1720018318, now seen corresponding path program 1 times [2024-10-11 14:10:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55851304] [2024-10-11 14:10:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55851304] [2024-10-11 14:10:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55851304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134872053] [2024-10-11 14:10:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:37,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:37,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:37,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-10-11 14:10:37,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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) [2024-10-11 14:10:37,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:37,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-10-11 14:10:37,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:39,591 INFO L124 PetriNetUnfolderBase]: 11279/20155 cut-off events. [2024-10-11 14:10:39,592 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2024-10-11 14:10:39,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37155 conditions, 20155 events. 11279/20155 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 173961 event pairs, 1143 based on Foata normal form. 1103/20329 useless extension candidates. Maximal degree in co-relation 32953. Up to 5230 conditions per place. [2024-10-11 14:10:39,831 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 159 selfloop transitions, 37 changer transitions 6/216 dead transitions. [2024-10-11 14:10:39,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 216 transitions, 944 flow [2024-10-11 14:10:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:10:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:10:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 452 transitions. [2024-10-11 14:10:39,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6438746438746439 [2024-10-11 14:10:39,851 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 117 flow. Second operand 13 states and 452 transitions. [2024-10-11 14:10:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 216 transitions, 944 flow [2024-10-11 14:10:39,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 216 transitions, 880 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 14:10:39,877 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 343 flow [2024-10-11 14:10:39,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2024-10-11 14:10:39,884 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2024-10-11 14:10:39,886 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 343 flow [2024-10-11 14:10:39,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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) [2024-10-11 14:10:39,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:39,887 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:10:39,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash 550720275, now seen corresponding path program 1 times [2024-10-11 14:10:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:39,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098804621] [2024-10-11 14:10:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098804621] [2024-10-11 14:10:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098804621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:10:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77457767] [2024-10-11 14:10:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:10:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:10:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:10:40,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-10-11 14:10:40,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-10-11 14:10:40,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:40,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-10-11 14:10:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:41,132 INFO L124 PetriNetUnfolderBase]: 4421/9940 cut-off events. [2024-10-11 14:10:41,133 INFO L125 PetriNetUnfolderBase]: For 1242/1384 co-relation queries the response was YES. [2024-10-11 14:10:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19419 conditions, 9940 events. 4421/9940 cut-off events. For 1242/1384 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 98021 event pairs, 1862 based on Foata normal form. 388/9507 useless extension candidates. Maximal degree in co-relation 18385. Up to 3454 conditions per place. [2024-10-11 14:10:41,195 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 35 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-10-11 14:10:41,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 457 flow [2024-10-11 14:10:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:10:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:10:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-10-11 14:10:41,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-10-11 14:10:41,199 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 343 flow. Second operand 3 states and 121 transitions. [2024-10-11 14:10:41,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 457 flow [2024-10-11 14:10:41,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:10:41,251 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 359 flow [2024-10-11 14:10:41,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2024-10-11 14:10:41,252 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2024-10-11 14:10:41,253 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 359 flow [2024-10-11 14:10:41,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-10-11 14:10:41,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:41,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:41,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:10:41,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2143072499, now seen corresponding path program 2 times [2024-10-11 14:10:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559038560] [2024-10-11 14:10:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559038560] [2024-10-11 14:10:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559038560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:10:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479609606] [2024-10-11 14:10:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:10:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:10:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:10:41,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-10-11 14:10:41,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2024-10-11 14:10:41,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:41,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-10-11 14:10:41,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:42,455 INFO L124 PetriNetUnfolderBase]: 5047/10609 cut-off events. [2024-10-11 14:10:42,456 INFO L125 PetriNetUnfolderBase]: For 3991/4100 co-relation queries the response was YES. [2024-10-11 14:10:42,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22773 conditions, 10609 events. 5047/10609 cut-off events. For 3991/4100 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 96505 event pairs, 1477 based on Foata normal form. 116/10284 useless extension candidates. Maximal degree in co-relation 21587. Up to 3290 conditions per place. [2024-10-11 14:10:42,511 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 50 selfloop transitions, 9 changer transitions 3/123 dead transitions. [2024-10-11 14:10:42,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 585 flow [2024-10-11 14:10:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:10:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:10:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-10-11 14:10:42,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-10-11 14:10:42,513 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 359 flow. Second operand 4 states and 168 transitions. [2024-10-11 14:10:42,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 585 flow [2024-10-11 14:10:42,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:10:42,575 INFO L231 Difference]: Finished difference. Result has 79 places, 91 transitions, 417 flow [2024-10-11 14:10:42,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=417, PETRI_PLACES=79, PETRI_TRANSITIONS=91} [2024-10-11 14:10:42,576 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-10-11 14:10:42,576 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 91 transitions, 417 flow [2024-10-11 14:10:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2024-10-11 14:10:42,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:42,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:42,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:10:42,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:42,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1215427923, now seen corresponding path program 1 times [2024-10-11 14:10:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810165699] [2024-10-11 14:10:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810165699] [2024-10-11 14:10:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810165699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302235289] [2024-10-11 14:10:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:42,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:42,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:42,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:42,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-10-11 14:10:42,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 91 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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) [2024-10-11 14:10:42,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:42,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-10-11 14:10:42,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:44,446 INFO L124 PetriNetUnfolderBase]: 12087/20515 cut-off events. [2024-10-11 14:10:44,446 INFO L125 PetriNetUnfolderBase]: For 17083/17661 co-relation queries the response was YES. [2024-10-11 14:10:44,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51076 conditions, 20515 events. 12087/20515 cut-off events. For 17083/17661 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 161312 event pairs, 1864 based on Foata normal form. 307/20446 useless extension candidates. Maximal degree in co-relation 49364. Up to 4494 conditions per place. [2024-10-11 14:10:44,541 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 159 selfloop transitions, 52 changer transitions 52/288 dead transitions. [2024-10-11 14:10:44,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 288 transitions, 1739 flow [2024-10-11 14:10:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:10:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:10:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 431 transitions. [2024-10-11 14:10:44,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.613960113960114 [2024-10-11 14:10:44,543 INFO L175 Difference]: Start difference. First operand has 79 places, 91 transitions, 417 flow. Second operand 13 states and 431 transitions. [2024-10-11 14:10:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 288 transitions, 1739 flow [2024-10-11 14:10:44,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 288 transitions, 1739 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:10:44,744 INFO L231 Difference]: Finished difference. Result has 102 places, 127 transitions, 836 flow [2024-10-11 14:10:44,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=836, PETRI_PLACES=102, PETRI_TRANSITIONS=127} [2024-10-11 14:10:44,745 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 43 predicate places. [2024-10-11 14:10:44,746 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 127 transitions, 836 flow [2024-10-11 14:10:44,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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) [2024-10-11 14:10:44,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:44,747 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:10:44,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:44,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -52753927, now seen corresponding path program 1 times [2024-10-11 14:10:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:44,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927313141] [2024-10-11 14:10:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927313141] [2024-10-11 14:10:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927313141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423018980] [2024-10-11 14:10:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:44,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:44,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:44,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-10-11 14:10:44,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 127 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2024-10-11 14:10:44,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:44,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-10-11 14:10:44,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:46,874 INFO L124 PetriNetUnfolderBase]: 11622/20390 cut-off events. [2024-10-11 14:10:46,875 INFO L125 PetriNetUnfolderBase]: For 28865/29218 co-relation queries the response was YES. [2024-10-11 14:10:46,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59796 conditions, 20390 events. 11622/20390 cut-off events. For 28865/29218 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 167348 event pairs, 2474 based on Foata normal form. 362/20656 useless extension candidates. Maximal degree in co-relation 56600. Up to 5490 conditions per place. [2024-10-11 14:10:46,979 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 163 selfloop transitions, 66 changer transitions 15/269 dead transitions. [2024-10-11 14:10:46,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 269 transitions, 1943 flow [2024-10-11 14:10:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:10:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:10:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 410 transitions. [2024-10-11 14:10:46,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584045584045584 [2024-10-11 14:10:46,981 INFO L175 Difference]: Start difference. First operand has 102 places, 127 transitions, 836 flow. Second operand 13 states and 410 transitions. [2024-10-11 14:10:46,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 269 transitions, 1943 flow [2024-10-11 14:10:47,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 269 transitions, 1903 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-11 14:10:47,457 INFO L231 Difference]: Finished difference. Result has 116 places, 149 transitions, 1152 flow [2024-10-11 14:10:47,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1152, PETRI_PLACES=116, PETRI_TRANSITIONS=149} [2024-10-11 14:10:47,458 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 57 predicate places. [2024-10-11 14:10:47,458 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 149 transitions, 1152 flow [2024-10-11 14:10:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2024-10-11 14:10:47,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:47,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:10:47,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:47,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 447331159, now seen corresponding path program 1 times [2024-10-11 14:10:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771879026] [2024-10-11 14:10:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771879026] [2024-10-11 14:10:47,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771879026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:47,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240885661] [2024-10-11 14:10:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:47,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:47,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-10-11 14:10:47,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 149 transitions, 1152 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2024-10-11 14:10:47,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:47,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-10-11 14:10:47,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:49,686 INFO L124 PetriNetUnfolderBase]: 12661/21860 cut-off events. [2024-10-11 14:10:49,686 INFO L125 PetriNetUnfolderBase]: For 36092/36542 co-relation queries the response was YES. [2024-10-11 14:10:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67044 conditions, 21860 events. 12661/21860 cut-off events. For 36092/36542 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 178233 event pairs, 2817 based on Foata normal form. 518/22151 useless extension candidates. Maximal degree in co-relation 64591. Up to 5895 conditions per place. [2024-10-11 14:10:50,047 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 169 selfloop transitions, 72 changer transitions 22/299 dead transitions. [2024-10-11 14:10:50,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 299 transitions, 2346 flow [2024-10-11 14:10:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:10:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:10:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 416 transitions. [2024-10-11 14:10:50,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-11 14:10:50,053 INFO L175 Difference]: Start difference. First operand has 116 places, 149 transitions, 1152 flow. Second operand 13 states and 416 transitions. [2024-10-11 14:10:50,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 299 transitions, 2346 flow [2024-10-11 14:10:50,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 299 transitions, 2332 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-10-11 14:10:50,466 INFO L231 Difference]: Finished difference. Result has 131 places, 171 transitions, 1525 flow [2024-10-11 14:10:50,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1525, PETRI_PLACES=131, PETRI_TRANSITIONS=171} [2024-10-11 14:10:50,467 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2024-10-11 14:10:50,467 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 171 transitions, 1525 flow [2024-10-11 14:10:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2024-10-11 14:10:50,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:50,468 INFO L204 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] [2024-10-11 14:10:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:10:50,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash 437649175, now seen corresponding path program 1 times [2024-10-11 14:10:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506510131] [2024-10-11 14:10:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:10:50,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:10:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:10:50,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:10:50,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:10:50,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-11 14:10:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-11 14:10:50,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-11 14:10:50,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-11 14:10:50,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-11 14:10:50,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-11 14:10:50,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-11 14:10:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:10:50,542 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-11 14:10:50,602 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:10:50,602 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:10:50,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:10:50 BasicIcfg [2024-10-11 14:10:50,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:10:50,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:10:50,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:10:50,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:10:50,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:36" (3/4) ... [2024-10-11 14:10:50,611 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:10:50,680 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:10:50,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:10:50,681 INFO L158 Benchmark]: Toolchain (without parser) took 15232.27ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 155.9MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 749.7MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,682 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:10:50,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.31ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 134.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.43ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 131.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,682 INFO L158 Benchmark]: Boogie Preprocessor took 44.75ms. Allocated memory is still 188.7MB. Free memory was 131.0MB in the beginning and 130.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,683 INFO L158 Benchmark]: RCFGBuilder took 525.55ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 108.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,685 INFO L158 Benchmark]: TraceAbstraction took 14049.71ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 108.0MB in the beginning and 7.6GB in the end (delta: -7.4GB). Peak memory consumption was 695.2MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,685 INFO L158 Benchmark]: Witness Printer took 72.48ms. Allocated memory is still 8.3GB. Free memory was 7.6GB in the beginning and 7.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:10:50,687 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 127.9MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.31ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 134.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.43ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 131.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.75ms. Allocated memory is still 188.7MB. Free memory was 131.0MB in the beginning and 130.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.55ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 108.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14049.71ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 108.0MB in the beginning and 7.6GB in the end (delta: -7.4GB). Peak memory consumption was 695.2MB. Max. memory is 16.1GB. * Witness Printer took 72.48ms. Allocated memory is still 8.3GB. Free memory was 7.6GB in the beginning and 7.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: 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: 750]: 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: 751]: 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: 752]: 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, 76 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1757 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 84 mSDtfsCounter, 1757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1525occurred in iteration=6, InterpolantAutomatonStates: 59, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:10:50,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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