./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:07:29,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:07:29,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:07:29,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:07:29,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:07:29,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:07:29,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:07:29,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:07:29,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:07:29,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:07:29,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:07:29,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:07:29,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:07:29,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:07:29,490 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:07:29,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:07:29,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:07:29,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:07:29,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:07:29,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:07:29,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:07:29,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:07:29,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:07:29,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:07:29,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:07:29,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:07:29,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:07:29,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:07:29,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:07:29,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:07:29,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:07:29,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:07:29,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:29,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:07:29,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:07:29,497 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:07:29,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:07:29,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:07:29,497 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/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/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-01-27 16:07:29,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:07:29,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:07:29,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:07:29,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:07:29,776 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:07:29,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-01-27 16:07:30,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:07:31,073 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:07:31,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-01-27 16:07:31,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ae36fde/24f4ee5f46a7406d8d916a261ae65d72/FLAG7a99b4805 [2024-01-27 16:07:31,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ae36fde/24f4ee5f46a7406d8d916a261ae65d72 [2024-01-27 16:07:31,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:07:31,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:07:31,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:31,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:07:31,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:07:31,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4192e9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31, skipping insertion in model container [2024-01-27 16:07:31,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:07:31,417 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2024-01-27 16:07:31,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:31,446 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:07:31,483 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2024-01-27 16:07:31,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:31,522 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:07:31,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31 WrapperNode [2024-01-27 16:07:31,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:31,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:31,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:07:31,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:07:31,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,583 INFO L138 Inliner]: procedures = 173, calls = 50, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-01-27 16:07:31,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:31,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:07:31,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:07:31,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:07:31,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,625 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 16:07:31,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:07:31,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:07:31,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:07:31,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:07:31,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (1/1) ... [2024-01-27 16:07:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:31,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:31,687 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) [2024-01-27 16:07:31,689 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 [2024-01-27 16:07:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:07:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:07:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:07:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:07:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:07:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:07:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:07:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-01-27 16:07:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-01-27 16:07:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:07:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:07:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:07:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:07:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:07:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:07:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:07:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:07:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:07:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:07:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-01-27 16:07:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-01-27 16:07:31,736 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:07:31,912 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:07:31,918 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:07:32,139 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:07:32,140 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:07:32,223 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:07:32,223 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:07:32,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:32 BoogieIcfgContainer [2024-01-27 16:07:32,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:07:32,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:07:32,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:07:32,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:07:32,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:07:31" (1/3) ... [2024-01-27 16:07:32,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:32, skipping insertion in model container [2024-01-27 16:07:32,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:31" (2/3) ... [2024-01-27 16:07:32,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:32, skipping insertion in model container [2024-01-27 16:07:32,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:32" (3/3) ... [2024-01-27 16:07:32,230 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-01-27 16:07:32,237 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:07:32,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:07:32,244 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:07:32,244 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:07:32,285 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 16:07:32,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 57 transitions, 142 flow [2024-01-27 16:07:32,339 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-01-27 16:07:32,339 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 16:07:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 53 events. 2/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-01-27 16:07:32,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 57 transitions, 142 flow [2024-01-27 16:07:32,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 123 flow [2024-01-27 16:07:32,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:07:32,374 INFO L357 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, mHoare=true, 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;@44bc9514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:07:32,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:07:32,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:07:32,391 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2024-01-27 16:07:32,391 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:07:32,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:32,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:32,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:32,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1937302976, now seen corresponding path program 1 times [2024-01-27 16:07:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575849854] [2024-01-27 16:07:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575849854] [2024-01-27 16:07:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575849854] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970042999] [2024-01-27 16:07:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:32,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:32,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:32,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-01-27 16:07:32,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 123 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-01-27 16:07:32,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:32,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-01-27 16:07:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:34,663 INFO L124 PetriNetUnfolderBase]: 12461/22123 cut-off events. [2024-01-27 16:07:34,664 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2024-01-27 16:07:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40825 conditions, 22123 events. 12461/22123 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 191888 event pairs, 1333 based on Foata normal form. 1220/22292 useless extension candidates. Maximal degree in co-relation 32953. Up to 5783 conditions per place. [2024-01-27 16:07:34,788 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 176 selfloop transitions, 37 changer transitions 6/233 dead transitions. [2024-01-27 16:07:34,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 233 transitions, 1012 flow [2024-01-27 16:07:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:07:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:07:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2024-01-27 16:07:34,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6329284750337382 [2024-01-27 16:07:34,801 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 123 flow. Second operand 13 states and 469 transitions. [2024-01-27 16:07:34,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 233 transitions, 1012 flow [2024-01-27 16:07:34,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 233 transitions, 948 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:34,817 INFO L231 Difference]: Finished difference. Result has 75 places, 88 transitions, 349 flow [2024-01-27 16:07:34,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=349, PETRI_PLACES=75, PETRI_TRANSITIONS=88} [2024-01-27 16:07:34,821 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-01-27 16:07:34,821 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 349 flow [2024-01-27 16:07:34,822 INFO L496 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-01-27 16:07:34,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:34,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:34,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:07:34,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:34,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 801931685, now seen corresponding path program 1 times [2024-01-27 16:07:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680834744] [2024-01-27 16:07:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680834744] [2024-01-27 16:07:34,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680834744] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:34,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:34,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210458932] [2024-01-27 16:07:34,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:34,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:07:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:34,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:07:34,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:07:34,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-01-27 16:07:34,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 349 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-01-27 16:07:34,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:34,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-01-27 16:07:34,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:35,805 INFO L124 PetriNetUnfolderBase]: 5264/11310 cut-off events. [2024-01-27 16:07:35,805 INFO L125 PetriNetUnfolderBase]: For 1624/1834 co-relation queries the response was YES. [2024-01-27 16:07:35,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22392 conditions, 11310 events. 5264/11310 cut-off events. For 1624/1834 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 110448 event pairs, 2226 based on Foata normal form. 392/10815 useless extension candidates. Maximal degree in co-relation 21206. Up to 3986 conditions per place. [2024-01-27 16:07:35,941 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 40 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2024-01-27 16:07:35,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 477 flow [2024-01-27 16:07:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:07:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:07:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-01-27 16:07:35,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2024-01-27 16:07:35,944 INFO L175 Difference]: Start difference. First operand has 75 places, 88 transitions, 349 flow. Second operand 3 states and 126 transitions. [2024-01-27 16:07:35,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 477 flow [2024-01-27 16:07:36,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 16:07:36,016 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 365 flow [2024-01-27 16:07:36,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2024-01-27 16:07:36,020 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2024-01-27 16:07:36,020 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 365 flow [2024-01-27 16:07:36,020 INFO L496 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-01-27 16:07:36,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:36,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:36,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:07:36,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:36,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1531572869, now seen corresponding path program 2 times [2024-01-27 16:07:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217165842] [2024-01-27 16:07:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217165842] [2024-01-27 16:07:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217165842] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010522555] [2024-01-27 16:07:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:36,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:07:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:07:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:07:36,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-01-27 16:07:36,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 365 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-01-27 16:07:36,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:36,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-01-27 16:07:36,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:36,921 INFO L124 PetriNetUnfolderBase]: 5414/11332 cut-off events. [2024-01-27 16:07:36,922 INFO L125 PetriNetUnfolderBase]: For 4069/4143 co-relation queries the response was YES. [2024-01-27 16:07:36,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24077 conditions, 11332 events. 5414/11332 cut-off events. For 4069/4143 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 103936 event pairs, 1639 based on Foata normal form. 126/10860 useless extension candidates. Maximal degree in co-relation 22911. Up to 3757 conditions per place. [2024-01-27 16:07:36,968 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 59 selfloop transitions, 9 changer transitions 3/132 dead transitions. [2024-01-27 16:07:36,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 621 flow [2024-01-27 16:07:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:07:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:07:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2024-01-27 16:07:36,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7763157894736842 [2024-01-27 16:07:36,969 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 365 flow. Second operand 4 states and 177 transitions. [2024-01-27 16:07:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 621 flow [2024-01-27 16:07:37,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:37,019 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 423 flow [2024-01-27 16:07:37,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2024-01-27 16:07:37,020 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2024-01-27 16:07:37,020 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 423 flow [2024-01-27 16:07:37,020 INFO L496 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-01-27 16:07:37,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:37,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:07:37,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:37,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1241268126, now seen corresponding path program 1 times [2024-01-27 16:07:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:37,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394241368] [2024-01-27 16:07:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394241368] [2024-01-27 16:07:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394241368] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:37,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:37,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626994040] [2024-01-27 16:07:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:37,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:37,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-01-27 16:07:37,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 423 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-01-27 16:07:37,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:37,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-01-27 16:07:37,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:38,804 INFO L124 PetriNetUnfolderBase]: 13844/23478 cut-off events. [2024-01-27 16:07:38,804 INFO L125 PetriNetUnfolderBase]: For 18949/19601 co-relation queries the response was YES. [2024-01-27 16:07:38,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58169 conditions, 23478 events. 13844/23478 cut-off events. For 18949/19601 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 187175 event pairs, 2194 based on Foata normal form. 350/23387 useless extension candidates. Maximal degree in co-relation 56243. Up to 5134 conditions per place. [2024-01-27 16:07:38,920 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 177 selfloop transitions, 52 changer transitions 67/321 dead transitions. [2024-01-27 16:07:38,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 321 transitions, 1871 flow [2024-01-27 16:07:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:07:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:07:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 464 transitions. [2024-01-27 16:07:38,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6261808367071525 [2024-01-27 16:07:38,923 INFO L175 Difference]: Start difference. First operand has 82 places, 94 transitions, 423 flow. Second operand 13 states and 464 transitions. [2024-01-27 16:07:38,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 321 transitions, 1871 flow [2024-01-27 16:07:39,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 321 transitions, 1871 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 16:07:39,293 INFO L231 Difference]: Finished difference. Result has 105 places, 130 transitions, 842 flow [2024-01-27 16:07:39,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=842, PETRI_PLACES=105, PETRI_TRANSITIONS=130} [2024-01-27 16:07:39,295 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 43 predicate places. [2024-01-27 16:07:39,295 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 130 transitions, 842 flow [2024-01-27 16:07:39,295 INFO L496 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-01-27 16:07:39,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:39,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:39,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:07:39,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:39,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -547652280, now seen corresponding path program 1 times [2024-01-27 16:07:39,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:39,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170918545] [2024-01-27 16:07:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170918545] [2024-01-27 16:07:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170918545] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948157710] [2024-01-27 16:07:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:39,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:39,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-01-27 16:07:39,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 130 transitions, 842 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-01-27 16:07:39,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:39,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-01-27 16:07:39,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:41,393 INFO L124 PetriNetUnfolderBase]: 13186/23128 cut-off events. [2024-01-27 16:07:41,394 INFO L125 PetriNetUnfolderBase]: For 32361/32761 co-relation queries the response was YES. [2024-01-27 16:07:41,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67578 conditions, 23128 events. 13186/23128 cut-off events. For 32361/32761 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 192326 event pairs, 2884 based on Foata normal form. 411/23381 useless extension candidates. Maximal degree in co-relation 63991. Up to 6148 conditions per place. [2024-01-27 16:07:41,507 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 180 selfloop transitions, 66 changer transitions 22/293 dead transitions. [2024-01-27 16:07:41,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 293 transitions, 2039 flow [2024-01-27 16:07:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:07:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:07:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 434 transitions. [2024-01-27 16:07:41,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5856950067476383 [2024-01-27 16:07:41,509 INFO L175 Difference]: Start difference. First operand has 105 places, 130 transitions, 842 flow. Second operand 13 states and 434 transitions. [2024-01-27 16:07:41,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 293 transitions, 2039 flow [2024-01-27 16:07:41,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 293 transitions, 1999 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:41,900 INFO L231 Difference]: Finished difference. Result has 119 places, 152 transitions, 1158 flow [2024-01-27 16:07:41,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1158, PETRI_PLACES=119, PETRI_TRANSITIONS=152} [2024-01-27 16:07:41,900 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 57 predicate places. [2024-01-27 16:07:41,901 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 152 transitions, 1158 flow [2024-01-27 16:07:42,012 INFO L496 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-01-27 16:07:42,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:42,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:42,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:07:42,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:42,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1920214280, now seen corresponding path program 1 times [2024-01-27 16:07:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200252619] [2024-01-27 16:07:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200252619] [2024-01-27 16:07:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200252619] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506729240] [2024-01-27 16:07:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:42,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:42,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-01-27 16:07:42,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 152 transitions, 1158 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-01-27 16:07:42,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:42,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-01-27 16:07:42,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:44,350 INFO L124 PetriNetUnfolderBase]: 14480/24931 cut-off events. [2024-01-27 16:07:44,350 INFO L125 PetriNetUnfolderBase]: For 40353/40877 co-relation queries the response was YES. [2024-01-27 16:07:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76109 conditions, 24931 events. 14480/24931 cut-off events. For 40353/40877 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 205035 event pairs, 3330 based on Foata normal form. 579/25226 useless extension candidates. Maximal degree in co-relation 73318. Up to 6812 conditions per place. [2024-01-27 16:07:44,478 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 183 selfloop transitions, 72 changer transitions 32/323 dead transitions. [2024-01-27 16:07:44,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 323 transitions, 2442 flow [2024-01-27 16:07:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:07:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:07:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 440 transitions. [2024-01-27 16:07:44,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5937921727395412 [2024-01-27 16:07:44,480 INFO L175 Difference]: Start difference. First operand has 119 places, 152 transitions, 1158 flow. Second operand 13 states and 440 transitions. [2024-01-27 16:07:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 323 transitions, 2442 flow [2024-01-27 16:07:44,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 2428 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-27 16:07:44,828 INFO L231 Difference]: Finished difference. Result has 134 places, 174 transitions, 1531 flow [2024-01-27 16:07:44,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1531, PETRI_PLACES=134, PETRI_TRANSITIONS=174} [2024-01-27 16:07:44,828 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 72 predicate places. [2024-01-27 16:07:44,829 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 174 transitions, 1531 flow [2024-01-27 16:07:44,829 INFO L496 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-01-27 16:07:44,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:44,829 INFO L208 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-01-27 16:07:44,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:07:44,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:44,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash 661989640, now seen corresponding path program 1 times [2024-01-27 16:07:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35440214] [2024-01-27 16:07:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:44,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35440214] [2024-01-27 16:07:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35440214] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:44,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201219911] [2024-01-27 16:07:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:44,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:44,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:44,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:44,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 57 [2024-01-27 16:07:44,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 174 transitions, 1531 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-01-27 16:07:44,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:44,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 57 [2024-01-27 16:07:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:46,900 INFO L124 PetriNetUnfolderBase]: 9384/18994 cut-off events. [2024-01-27 16:07:46,901 INFO L125 PetriNetUnfolderBase]: For 37015/37840 co-relation queries the response was YES. [2024-01-27 16:07:46,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58947 conditions, 18994 events. 9384/18994 cut-off events. For 37015/37840 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 179467 event pairs, 1853 based on Foata normal form. 252/18916 useless extension candidates. Maximal degree in co-relation 57043. Up to 3131 conditions per place. [2024-01-27 16:07:46,984 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 79 selfloop transitions, 16 changer transitions 52/277 dead transitions. [2024-01-27 16:07:46,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 277 transitions, 2163 flow [2024-01-27 16:07:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:07:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:07:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2024-01-27 16:07:46,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2024-01-27 16:07:46,986 INFO L175 Difference]: Start difference. First operand has 134 places, 174 transitions, 1531 flow. Second operand 8 states and 328 transitions. [2024-01-27 16:07:46,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 277 transitions, 2163 flow [2024-01-27 16:07:47,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 277 transitions, 2129 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-01-27 16:07:47,383 INFO L231 Difference]: Finished difference. Result has 143 places, 176 transitions, 1564 flow [2024-01-27 16:07:47,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1564, PETRI_PLACES=143, PETRI_TRANSITIONS=176} [2024-01-27 16:07:47,384 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 81 predicate places. [2024-01-27 16:07:47,384 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 176 transitions, 1564 flow [2024-01-27 16:07:47,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-01-27 16:07:47,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:47,384 INFO L208 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-01-27 16:07:47,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:07:47,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:47,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 447315388, now seen corresponding path program 2 times [2024-01-27 16:07:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62662214] [2024-01-27 16:07:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62662214] [2024-01-27 16:07:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62662214] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791765755] [2024-01-27 16:07:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:47,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:47,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 57 [2024-01-27 16:07:47,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 176 transitions, 1564 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-01-27 16:07:47,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:47,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 57 [2024-01-27 16:07:47,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:48,890 INFO L124 PetriNetUnfolderBase]: 6531/13711 cut-off events. [2024-01-27 16:07:48,890 INFO L125 PetriNetUnfolderBase]: For 31241/31632 co-relation queries the response was YES. [2024-01-27 16:07:48,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45555 conditions, 13711 events. 6531/13711 cut-off events. For 31241/31632 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 128996 event pairs, 2011 based on Foata normal form. 420/13782 useless extension candidates. Maximal degree in co-relation 44350. Up to 4215 conditions per place. [2024-01-27 16:07:48,981 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 74 selfloop transitions, 17 changer transitions 18/226 dead transitions. [2024-01-27 16:07:48,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 226 transitions, 1856 flow [2024-01-27 16:07:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:07:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:07:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2024-01-27 16:07:48,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6591478696741855 [2024-01-27 16:07:48,983 INFO L175 Difference]: Start difference. First operand has 143 places, 176 transitions, 1564 flow. Second operand 7 states and 263 transitions. [2024-01-27 16:07:48,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 226 transitions, 1856 flow [2024-01-27 16:07:49,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 226 transitions, 1769 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:49,279 INFO L231 Difference]: Finished difference. Result has 143 places, 164 transitions, 1386 flow [2024-01-27 16:07:49,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1386, PETRI_PLACES=143, PETRI_TRANSITIONS=164} [2024-01-27 16:07:49,280 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 81 predicate places. [2024-01-27 16:07:49,280 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 164 transitions, 1386 flow [2024-01-27 16:07:49,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-01-27 16:07:49,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:49,280 INFO L208 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-01-27 16:07:49,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:07:49,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:49,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1932270390, now seen corresponding path program 3 times [2024-01-27 16:07:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335231347] [2024-01-27 16:07:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:49,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:49,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:49,335 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:49,336 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:07:49,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:07:49,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:07:49,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:07:49,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-01-27 16:07:49,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-01-27 16:07:49,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:07:49,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:07:49,341 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-01-27 16:07:49,346 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:49,346 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:49,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:07:49 BasicIcfg [2024-01-27 16:07:49,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:49,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:49,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:49,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:49,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:32" (3/4) ... [2024-01-27 16:07:49,402 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:49,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:49,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:49,467 INFO L158 Benchmark]: Toolchain (without parser) took 18364.35ms. Allocated memory was 201.3MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 158.8MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-01-27 16:07:49,468 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:49,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.27ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 138.5MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-01-27 16:07:49,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.81ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 135.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:49,468 INFO L158 Benchmark]: Boogie Preprocessor took 69.03ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:49,469 INFO L158 Benchmark]: RCFGBuilder took 569.54ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 150.5MB in the end (delta: -16.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 16:07:49,469 INFO L158 Benchmark]: TraceAbstraction took 17174.95ms. Allocated memory was 201.3MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 150.3MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-01-27 16:07:49,469 INFO L158 Benchmark]: Witness Printer took 66.58ms. Allocated memory is still 10.1GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:49,471 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.15ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.27ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 138.5MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.81ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 135.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.03ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.54ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 150.5MB in the end (delta: -16.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17174.95ms. Allocated memory was 201.3MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 150.3MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 66.58ms. Allocated memory is still 10.1GB. Free memory was 8.8GB in the beginning and 8.8GB 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={7:0}, t2={8:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1={7:0}, t2={8:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [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={7:0}, t2={8:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1={7:0}, t2={8:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, r=0, 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 [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [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 [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 [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() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [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() [L733] 4 int ly = y; VAL [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 [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [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 [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 [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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 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: 17.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 989 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 100 mSDtfsCounter, 2532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1564occurred in iteration=7, InterpolantAutomatonStates: 74, 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.6s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-01-27 16:07:49,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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