/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:55:29,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:55:29,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:55:29,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:55:29,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:55:29,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:55:29,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:55:29,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:55:29,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:55:29,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:55:29,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:55:29,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:55:29,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:55:29,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:55:29,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:55:29,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:55:29,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:55:29,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:55:29,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:55:29,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:55:29,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:55:29,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:55:29,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:55:29,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:55:29,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:55:29,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:55:29,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:55:29,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:55:29,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:55:29,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:55:29,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:55:29,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:55:29,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:55:29,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:55:29,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:55:29,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:55:29,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:55:29,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:55:29,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:55:29,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:55:29,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:55:29,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 18:55:29,214 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:55:29,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:55:29,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:55:29,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:55:29,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:55:29,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:55:29,217 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:55:29,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:55:29,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:55:29,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:55:29,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:55:29,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:55:29,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:55:29,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:55:29,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:55:29,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:55:29,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:55:29,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:55:29,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:55:29,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:55:29,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-11 18:55:29,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:55:29,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:55:29,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:55:29,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:55:29,566 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:55:29,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-12-11 18:55:30,710 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:55:30,974 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:55:30,975 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-12-11 18:55:30,993 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43754fc9/03aa2eb46b7d48dab7a14352c972d649/FLAG5b651af94 [2022-12-11 18:55:31,008 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43754fc9/03aa2eb46b7d48dab7a14352c972d649 [2022-12-11 18:55:31,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:55:31,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:55:31,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:55:31,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:55:31,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:55:31,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383bd924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31, skipping insertion in model container [2022-12-11 18:55:31,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:55:31,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:55:31,199 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-11 18:55:31,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,344 WARN L237 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] [2022-12-11 18:55:31,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:55:31,370 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:55:31,395 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-11 18:55:31,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,426 WARN L237 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] [2022-12-11 18:55:31,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:31,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:31,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:55:31,476 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:55:31,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31 WrapperNode [2022-12-11 18:55:31,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:55:31,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:55:31,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:55:31,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:55:31,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,544 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-12-11 18:55:31,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:55:31,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:55:31,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:55:31,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:55:31,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:55:31,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:55:31,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:55:31,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:55:31,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (1/1) ... [2022-12-11 18:55:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:55:31,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:55:31,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 18:55:31,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 18:55:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 18:55:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:55:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 18:55:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:55:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-12-11 18:55:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-12-11 18:55:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:55:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:55:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:55:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 18:55:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:55:31,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:55:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-12-11 18:55:31,658 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-12-11 18:55:31,660 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 18:55:31,783 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:55:31,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:55:31,944 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:55:32,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:55:32,017 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 18:55:32,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:55:32 BoogieIcfgContainer [2022-12-11 18:55:32,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:55:32,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:55:32,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:55:32,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:55:32,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:55:31" (1/3) ... [2022-12-11 18:55:32,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e86b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:55:32, skipping insertion in model container [2022-12-11 18:55:32,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:31" (2/3) ... [2022-12-11 18:55:32,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e86b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:55:32, skipping insertion in model container [2022-12-11 18:55:32,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:55:32" (3/3) ... [2022-12-11 18:55:32,027 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-12-11 18:55:32,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:55:32,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 18:55:32,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:55:32,114 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-11 18:55:32,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 252 flow [2022-12-11 18:55:32,230 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-11 18:55:32,230 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 18:55:32,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 2/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-11 18:55:32,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 252 flow [2022-12-11 18:55:32,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 207 flow [2022-12-11 18:55:32,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:55:32,266 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21d2f81c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:55:32,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 18:55:32,291 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-11 18:55:32,292 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:55:32,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:32,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:32,295 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)] === [2022-12-11 18:55:32,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1181809175, now seen corresponding path program 1 times [2022-12-11 18:55:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:32,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708305570] [2022-12-11 18:55:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:32,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:32,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708305570] [2022-12-11 18:55:32,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708305570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:32,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:32,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104042344] [2022-12-11 18:55:32,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:32,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 110 [2022-12-11 18:55:32,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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) [2022-12-11 18:55:32,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:32,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 110 [2022-12-11 18:55:32,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:34,113 INFO L130 PetriNetUnfolder]: 3525/7707 cut-off events. [2022-12-11 18:55:34,114 INFO L131 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-12-11 18:55:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13861 conditions, 7707 events. 3525/7707 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 71405 event pairs, 957 based on Foata normal form. 422/7821 useless extension candidates. Maximal degree in co-relation 13400. Up to 1729 conditions per place. [2022-12-11 18:55:34,187 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 116 selfloop transitions, 32 changer transitions 0/211 dead transitions. [2022-12-11 18:55:34,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 211 transitions, 817 flow [2022-12-11 18:55:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 18:55:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 18:55:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1112 transitions. [2022-12-11 18:55:34,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2022-12-11 18:55:34,207 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 207 flow. Second operand 12 states and 1112 transitions. [2022-12-11 18:55:34,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 211 transitions, 817 flow [2022-12-11 18:55:34,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 211 transitions, 758 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-12-11 18:55:34,219 INFO L231 Difference]: Finished difference. Result has 116 places, 126 transitions, 410 flow [2022-12-11 18:55:34,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=410, PETRI_PLACES=116, PETRI_TRANSITIONS=126} [2022-12-11 18:55:34,223 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 12 predicate places. [2022-12-11 18:55:34,224 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 126 transitions, 410 flow [2022-12-11 18:55:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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) [2022-12-11 18:55:34,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:34,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:55:34,225 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)] === [2022-12-11 18:55:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1324933873, now seen corresponding path program 1 times [2022-12-11 18:55:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97275466] [2022-12-11 18:55:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97275466] [2022-12-11 18:55:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97275466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:34,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 18:55:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303829419] [2022-12-11 18:55:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:55:34,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:55:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:55:34,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 110 [2022-12-11 18:55:34,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 126 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2022-12-11 18:55:34,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:34,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 110 [2022-12-11 18:55:34,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:34,679 INFO L130 PetriNetUnfolder]: 390/1964 cut-off events. [2022-12-11 18:55:34,679 INFO L131 PetriNetUnfolder]: For 395/403 co-relation queries the response was YES. [2022-12-11 18:55:34,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 1964 events. 390/1964 cut-off events. For 395/403 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18453 event pairs, 134 based on Foata normal form. 50/1935 useless extension candidates. Maximal degree in co-relation 3283. Up to 253 conditions per place. [2022-12-11 18:55:34,695 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 15 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2022-12-11 18:55:34,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 131 transitions, 464 flow [2022-12-11 18:55:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:55:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:55:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2022-12-11 18:55:34,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9151515151515152 [2022-12-11 18:55:34,698 INFO L175 Difference]: Start difference. First operand has 116 places, 126 transitions, 410 flow. Second operand 3 states and 302 transitions. [2022-12-11 18:55:34,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 131 transitions, 464 flow [2022-12-11 18:55:34,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 131 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 18:55:34,715 INFO L231 Difference]: Finished difference. Result has 119 places, 126 transitions, 426 flow [2022-12-11 18:55:34,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=119, PETRI_TRANSITIONS=126} [2022-12-11 18:55:34,717 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 15 predicate places. [2022-12-11 18:55:34,718 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 126 transitions, 426 flow [2022-12-11 18:55:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2022-12-11 18:55:34,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:34,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:55:34,719 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)] === [2022-12-11 18:55:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1076645205, now seen corresponding path program 2 times [2022-12-11 18:55:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652795712] [2022-12-11 18:55:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55: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. [2022-12-11 18:55:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:34,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652795712] [2022-12-11 18:55:34,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652795712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:34,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:34,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 18:55:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727902196] [2022-12-11 18:55:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:34,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 18:55:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 18:55:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 18:55:34,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 110 [2022-12-11 18:55:34,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 126 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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) [2022-12-11 18:55:34,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:34,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 110 [2022-12-11 18:55:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:35,306 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][134], [75#L753-2true, 114#L741true, 99#L717true, 36#L725-1true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 156#(not (= ~w~0 0)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), readerThread1of1ForFork2InUse, Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 163#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-12-11 18:55:35,306 INFO L382 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2022-12-11 18:55:35,307 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-11 18:55:35,307 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-11 18:55:35,307 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-11 18:55:35,348 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][134], [75#L753-2true, 114#L741true, 99#L717true, 54#L731true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 156#(not (= ~w~0 0)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), readerThread1of1ForFork2InUse, Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 163#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-12-11 18:55:35,348 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-12-11 18:55:35,349 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-12-11 18:55:35,349 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-12-11 18:55:35,349 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-12-11 18:55:35,376 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][134], [75#L753-2true, 114#L741true, 99#L717true, 88#L741true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 156#(not (= ~w~0 0)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), readerThread1of1ForFork2InUse, Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 163#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-12-11 18:55:35,376 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 18:55:35,376 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 18:55:35,376 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 18:55:35,376 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 18:55:35,407 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][151], [75#L753-2true, 114#L741true, 99#L717true, 161#(or (not (= ~w~0 0)) (not (= ~r~0 0))), 110#L744true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 156#(not (= ~w~0 0)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), readerThread1of1ForFork2InUse, Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2022-12-11 18:55:35,407 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 18:55:35,407 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:35,407 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:35,407 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:35,422 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][134], [75#L753-2true, 114#L741true, 99#L717true, 110#L744true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 156#(not (= ~w~0 0)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), readerThread1of1ForFork2InUse, Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 163#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-12-11 18:55:35,423 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-11 18:55:35,423 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 18:55:35,423 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 18:55:35,423 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 18:55:35,459 INFO L130 PetriNetUnfolder]: 1531/4747 cut-off events. [2022-12-11 18:55:35,459 INFO L131 PetriNetUnfolder]: For 2291/2412 co-relation queries the response was YES. [2022-12-11 18:55:35,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9870 conditions, 4747 events. 1531/4747 cut-off events. For 2291/2412 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 48422 event pairs, 182 based on Foata normal form. 48/4582 useless extension candidates. Maximal degree in co-relation 8606. Up to 781 conditions per place. [2022-12-11 18:55:35,501 INFO L137 encePairwiseOnDemand]: 101/110 looper letters, 47 selfloop transitions, 19 changer transitions 2/172 dead transitions. [2022-12-11 18:55:35,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 172 transitions, 731 flow [2022-12-11 18:55:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 18:55:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 18:55:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2022-12-11 18:55:35,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9054545454545454 [2022-12-11 18:55:35,503 INFO L175 Difference]: Start difference. First operand has 119 places, 126 transitions, 426 flow. Second operand 5 states and 498 transitions. [2022-12-11 18:55:35,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 172 transitions, 731 flow [2022-12-11 18:55:35,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 172 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:55:35,520 INFO L231 Difference]: Finished difference. Result has 121 places, 140 transitions, 504 flow [2022-12-11 18:55:35,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=121, PETRI_TRANSITIONS=140} [2022-12-11 18:55:35,521 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 17 predicate places. [2022-12-11 18:55:35,522 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 140 transitions, 504 flow [2022-12-11 18:55:35,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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) [2022-12-11 18:55:35,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:35,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:55:35,523 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)] === [2022-12-11 18:55:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -901588045, now seen corresponding path program 1 times [2022-12-11 18:55:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:35,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729844649] [2022-12-11 18:55:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:35,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:35,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729844649] [2022-12-11 18:55:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729844649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:35,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:35,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531142646] [2022-12-11 18:55:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:35,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:35,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 110 [2022-12-11 18:55:35,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 140 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2022-12-11 18:55:35,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:35,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 110 [2022-12-11 18:55:35,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:37,772 INFO L130 PetriNetUnfolder]: 8131/17867 cut-off events. [2022-12-11 18:55:37,772 INFO L131 PetriNetUnfolder]: For 15549/15628 co-relation queries the response was YES. [2022-12-11 18:55:37,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44380 conditions, 17867 events. 8131/17867 cut-off events. For 15549/15628 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 195690 event pairs, 1270 based on Foata normal form. 20/17358 useless extension candidates. Maximal degree in co-relation 43808. Up to 3340 conditions per place. [2022-12-11 18:55:37,936 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 207 selfloop transitions, 134 changer transitions 25/439 dead transitions. [2022-12-11 18:55:37,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 439 transitions, 2680 flow [2022-12-11 18:55:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 18:55:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 18:55:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1103 transitions. [2022-12-11 18:55:37,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8356060606060606 [2022-12-11 18:55:37,940 INFO L175 Difference]: Start difference. First operand has 121 places, 140 transitions, 504 flow. Second operand 12 states and 1103 transitions. [2022-12-11 18:55:37,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 439 transitions, 2680 flow [2022-12-11 18:55:38,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 439 transitions, 2674 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-11 18:55:38,132 INFO L231 Difference]: Finished difference. Result has 140 places, 295 transitions, 1894 flow [2022-12-11 18:55:38,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1894, PETRI_PLACES=140, PETRI_TRANSITIONS=295} [2022-12-11 18:55:38,134 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 36 predicate places. [2022-12-11 18:55:38,134 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 295 transitions, 1894 flow [2022-12-11 18:55:38,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2022-12-11 18:55:38,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:38,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:38,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:55:38,135 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)] === [2022-12-11 18:55:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1489495263, now seen corresponding path program 1 times [2022-12-11 18:55:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805073018] [2022-12-11 18:55:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:38,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:38,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805073018] [2022-12-11 18:55:38,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805073018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:38,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:38,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432608091] [2022-12-11 18:55:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:38,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 110 [2022-12-11 18:55:38,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 295 transitions, 1894 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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) [2022-12-11 18:55:38,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:38,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 110 [2022-12-11 18:55:38,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:40,901 INFO L130 PetriNetUnfolder]: 9006/19877 cut-off events. [2022-12-11 18:55:40,902 INFO L131 PetriNetUnfolder]: For 29339/29437 co-relation queries the response was YES. [2022-12-11 18:55:40,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59348 conditions, 19877 events. 9006/19877 cut-off events. For 29339/29437 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 221742 event pairs, 1488 based on Foata normal form. 223/19909 useless extension candidates. Maximal degree in co-relation 58727. Up to 4759 conditions per place. [2022-12-11 18:55:41,168 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 237 selfloop transitions, 206 changer transitions 5/521 dead transitions. [2022-12-11 18:55:41,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 521 transitions, 4183 flow [2022-12-11 18:55:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:55:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:55:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1183 transitions. [2022-12-11 18:55:41,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8272727272727273 [2022-12-11 18:55:41,173 INFO L175 Difference]: Start difference. First operand has 140 places, 295 transitions, 1894 flow. Second operand 13 states and 1183 transitions. [2022-12-11 18:55:41,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 521 transitions, 4183 flow [2022-12-11 18:55:41,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 521 transitions, 4183 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 18:55:41,603 INFO L231 Difference]: Finished difference. Result has 160 places, 383 transitions, 3332 flow [2022-12-11 18:55:41,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3332, PETRI_PLACES=160, PETRI_TRANSITIONS=383} [2022-12-11 18:55:41,604 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 56 predicate places. [2022-12-11 18:55:41,604 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 383 transitions, 3332 flow [2022-12-11 18:55:41,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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) [2022-12-11 18:55:41,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:41,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:41,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 18:55:41,605 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)] === [2022-12-11 18:55:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1438952769, now seen corresponding path program 1 times [2022-12-11 18:55:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:41,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917341578] [2022-12-11 18:55:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917341578] [2022-12-11 18:55:41,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917341578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:41,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:41,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015831710] [2022-12-11 18:55:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:41,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 110 [2022-12-11 18:55:41,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 383 transitions, 3332 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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) [2022-12-11 18:55:41,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:41,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 110 [2022-12-11 18:55:41,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:44,400 INFO L130 PetriNetUnfolder]: 9856/21528 cut-off events. [2022-12-11 18:55:44,400 INFO L131 PetriNetUnfolder]: For 51369/51416 co-relation queries the response was YES. [2022-12-11 18:55:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70939 conditions, 21528 events. 9856/21528 cut-off events. For 51369/51416 co-relation queries the response was YES. Maximal size of possible extension queue 1938. Compared 240176 event pairs, 1679 based on Foata normal form. 239/21576 useless extension candidates. Maximal degree in co-relation 70148. Up to 5659 conditions per place. [2022-12-11 18:55:44,702 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 295 selfloop transitions, 249 changer transitions 8/640 dead transitions. [2022-12-11 18:55:44,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 640 transitions, 6323 flow [2022-12-11 18:55:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:55:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:55:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1187 transitions. [2022-12-11 18:55:44,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.83006993006993 [2022-12-11 18:55:44,706 INFO L175 Difference]: Start difference. First operand has 160 places, 383 transitions, 3332 flow. Second operand 13 states and 1187 transitions. [2022-12-11 18:55:44,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 640 transitions, 6323 flow [2022-12-11 18:55:45,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 640 transitions, 6255 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-11 18:55:45,613 INFO L231 Difference]: Finished difference. Result has 179 places, 481 transitions, 5108 flow [2022-12-11 18:55:45,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=3288, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5108, PETRI_PLACES=179, PETRI_TRANSITIONS=481} [2022-12-11 18:55:45,614 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 75 predicate places. [2022-12-11 18:55:45,614 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 481 transitions, 5108 flow [2022-12-11 18:55:45,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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) [2022-12-11 18:55:45,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:45,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:55:45,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:55:45,616 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)] === [2022-12-11 18:55:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2035514362, now seen corresponding path program 1 times [2022-12-11 18:55:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:45,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733039560] [2022-12-11 18:55:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733039560] [2022-12-11 18:55:45,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733039560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:45,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:45,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 18:55:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964976285] [2022-12-11 18:55:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:45,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 18:55:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 18:55:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 18:55:45,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 110 [2022-12-11 18:55:45,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 481 transitions, 5108 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 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) [2022-12-11 18:55:45,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:45,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 110 [2022-12-11 18:55:45,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:46,364 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([226] L738-2-->L741: Formula: (= v_~r~0_3 (+ |v_readerThread1of1ForFork2_~l~0#1_7| 1)) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1][241], [Black: 166#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 173#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 88#L741true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 214#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 201#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 208#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 194#true, Black: 197#(= ~y~0 ~x~0), Black: 204#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 258#(= ~r~0 0), Black: 212#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), 75#L753-2true, 99#L717true, 41#L744true, readerThread1of1ForFork2InUse, 199#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 225#true, Black: 235#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 169#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 171#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 243#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|)), Black: 245#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 179#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 181#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 239#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 230#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 164#true, Black: 175#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 163#(and (not (= ~w~0 0)) (= ~r~0 0)), Black: 228#(= ~y~0 ~x~0), Black: 232#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-12-11 18:55:46,364 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 18:55:46,365 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:46,365 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:46,365 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 18:55:46,405 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([226] L738-2-->L741: Formula: (= v_~r~0_3 (+ |v_readerThread1of1ForFork2_~l~0#1_7| 1)) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1][241], [Black: 166#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 173#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 88#L741true, Black: 139#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 124#true, Black: 141#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 131#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 214#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 126#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 201#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 208#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 194#true, Black: 197#(= ~y~0 ~x~0), Black: 204#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 258#(= ~r~0 0), Black: 212#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), 99#L717true, 59#L754-2true, readerThread1of1ForFork2InUse, 199#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 225#true, 169#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 235#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 171#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 243#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|)), Black: 245#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 129#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 179#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 181#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 239#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 230#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 164#true, Black: 175#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 228#(= ~y~0 ~x~0), 163#(and (not (= ~w~0 0)) (= ~r~0 0)), Black: 232#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-12-11 18:55:46,406 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-11 18:55:46,406 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 18:55:46,406 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 18:55:46,406 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 18:55:46,428 INFO L130 PetriNetUnfolder]: 919/3521 cut-off events. [2022-12-11 18:55:46,428 INFO L131 PetriNetUnfolder]: For 8107/8195 co-relation queries the response was YES. [2022-12-11 18:55:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 3521 events. 919/3521 cut-off events. For 8107/8195 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 35459 event pairs, 97 based on Foata normal form. 118/3595 useless extension candidates. Maximal degree in co-relation 10198. Up to 547 conditions per place. [2022-12-11 18:55:46,453 INFO L137 encePairwiseOnDemand]: 103/110 looper letters, 38 selfloop transitions, 11 changer transitions 50/278 dead transitions. [2022-12-11 18:55:46,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 278 transitions, 2256 flow [2022-12-11 18:55:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 18:55:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 18:55:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-12-11 18:55:46,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9127272727272727 [2022-12-11 18:55:46,461 INFO L175 Difference]: Start difference. First operand has 179 places, 481 transitions, 5108 flow. Second operand 5 states and 502 transitions. [2022-12-11 18:55:46,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 278 transitions, 2256 flow [2022-12-11 18:55:46,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 278 transitions, 2213 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-11 18:55:46,523 INFO L231 Difference]: Finished difference. Result has 182 places, 218 transitions, 1633 flow [2022-12-11 18:55:46,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1633, PETRI_PLACES=182, PETRI_TRANSITIONS=218} [2022-12-11 18:55:46,525 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 78 predicate places. [2022-12-11 18:55:46,525 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 218 transitions, 1633 flow [2022-12-11 18:55:46,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 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) [2022-12-11 18:55:46,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:46,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-12-11 18:55:46,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 18:55:46,526 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)] === [2022-12-11 18:55:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1059271513, now seen corresponding path program 1 times [2022-12-11 18:55:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:46,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313213509] [2022-12-11 18:55:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313213509] [2022-12-11 18:55:46,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313213509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:46,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:46,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049100174] [2022-12-11 18:55:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:46,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:46,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 110 [2022-12-11 18:55:46,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 218 transitions, 1633 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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) [2022-12-11 18:55:46,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:46,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 110 [2022-12-11 18:55:46,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:47,139 INFO L130 PetriNetUnfolder]: 804/3025 cut-off events. [2022-12-11 18:55:47,140 INFO L131 PetriNetUnfolder]: For 8193/8252 co-relation queries the response was YES. [2022-12-11 18:55:47,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10119 conditions, 3025 events. 804/3025 cut-off events. For 8193/8252 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 30102 event pairs, 127 based on Foata normal form. 12/2998 useless extension candidates. Maximal degree in co-relation 9675. Up to 328 conditions per place. [2022-12-11 18:55:47,168 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 54 selfloop transitions, 17 changer transitions 32/270 dead transitions. [2022-12-11 18:55:47,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 270 transitions, 2139 flow [2022-12-11 18:55:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 18:55:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 18:55:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 771 transitions. [2022-12-11 18:55:47,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8761363636363636 [2022-12-11 18:55:47,171 INFO L175 Difference]: Start difference. First operand has 182 places, 218 transitions, 1633 flow. Second operand 8 states and 771 transitions. [2022-12-11 18:55:47,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 270 transitions, 2139 flow [2022-12-11 18:55:47,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 270 transitions, 2084 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-11 18:55:47,230 INFO L231 Difference]: Finished difference. Result has 184 places, 218 transitions, 1635 flow [2022-12-11 18:55:47,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1635, PETRI_PLACES=184, PETRI_TRANSITIONS=218} [2022-12-11 18:55:47,233 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 80 predicate places. [2022-12-11 18:55:47,233 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 218 transitions, 1635 flow [2022-12-11 18:55:47,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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) [2022-12-11 18:55:47,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:47,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-12-11 18:55:47,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 18:55:47,234 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)] === [2022-12-11 18:55:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -601541037, now seen corresponding path program 2 times [2022-12-11 18:55:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:47,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368662622] [2022-12-11 18:55:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:55:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:47,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368662622] [2022-12-11 18:55:47,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368662622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:47,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:47,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195826975] [2022-12-11 18:55:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:47,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:47,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 110 [2022-12-11 18:55:47,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 218 transitions, 1635 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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) [2022-12-11 18:55:47,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:47,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 110 [2022-12-11 18:55:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:47,859 INFO L130 PetriNetUnfolder]: 643/2597 cut-off events. [2022-12-11 18:55:47,859 INFO L131 PetriNetUnfolder]: For 6725/6796 co-relation queries the response was YES. [2022-12-11 18:55:47,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8337 conditions, 2597 events. 643/2597 cut-off events. For 6725/6796 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25211 event pairs, 119 based on Foata normal form. 57/2617 useless extension candidates. Maximal degree in co-relation 8046. Up to 367 conditions per place. [2022-12-11 18:55:47,876 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 51 selfloop transitions, 14 changer transitions 20/236 dead transitions. [2022-12-11 18:55:47,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 236 transitions, 1816 flow [2022-12-11 18:55:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 18:55:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 18:55:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 670 transitions. [2022-12-11 18:55:47,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2022-12-11 18:55:47,885 INFO L175 Difference]: Start difference. First operand has 184 places, 218 transitions, 1635 flow. Second operand 7 states and 670 transitions. [2022-12-11 18:55:47,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 236 transitions, 1816 flow [2022-12-11 18:55:47,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 236 transitions, 1761 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-11 18:55:47,920 INFO L231 Difference]: Finished difference. Result has 187 places, 198 transitions, 1384 flow [2022-12-11 18:55:47,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1384, PETRI_PLACES=187, PETRI_TRANSITIONS=198} [2022-12-11 18:55:47,920 INFO L295 CegarLoopForPetriNet]: 104 programPoint places, 83 predicate places. [2022-12-11 18:55:47,920 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 198 transitions, 1384 flow [2022-12-11 18:55:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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) [2022-12-11 18:55:47,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:47,921 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-12-11 18:55:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 18:55:47,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:55:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1014406231, now seen corresponding path program 3 times [2022-12-11 18:55:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:47,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536214826] [2022-12-11 18:55:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:55:47,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 18:55:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:55:47,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 18:55:47,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 18:55:47,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 18:55:47,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 18:55:47,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 18:55:47,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 18:55:47,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 18:55:47,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 18:55:47,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 18:55:47,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 18:55:47,991 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-12-11 18:55:47,996 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 18:55:47,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 18:55:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 06:55:48 BasicIcfg [2022-12-11 18:55:48,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 18:55:48,061 INFO L158 Benchmark]: Toolchain (without parser) took 17050.72ms. Allocated memory was 182.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 156.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 670.7MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,062 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory was 159.3MB in the beginning and 159.2MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 18:55:48,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.65ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 134.7MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.85ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,062 INFO L158 Benchmark]: Boogie Preprocessor took 35.23ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 131.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,063 INFO L158 Benchmark]: RCFGBuilder took 437.80ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 114.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,063 INFO L158 Benchmark]: TraceAbstraction took 16039.83ms. Allocated memory was 182.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 113.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 627.7MB. Max. memory is 8.0GB. [2022-12-11 18:55:48,064 INFO L339 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 182.5MB. Free memory was 159.3MB in the beginning and 159.2MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.65ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 134.7MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.85ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.23ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 131.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 437.80ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 114.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 16039.83ms. Allocated memory was 182.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 113.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 627.7MB. Max. memory is 8.0GB. * 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; VAL [r=0, w=0, x=0, y=0] [L748] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5: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] [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() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [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] [L724] 4 int l; 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] [L733] 4 int ly = y; 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() [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, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 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: 15.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 172 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5108occurred in iteration=6, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-12-11 18:55:48,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...