/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -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-8d0d62b [2022-12-06 00:57:28,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:57:28,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:57:28,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:57:28,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:57:28,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:57:28,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:57:28,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:57:28,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:57:28,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:57:28,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:57:28,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:57:28,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:57:28,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:57:28,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:57:28,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:57:28,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:57:28,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:57:28,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:57:28,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:57:28,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:57:28,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:57:28,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:57:28,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:57:28,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:57:28,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:57:28,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:57:28,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:57:28,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:57:28,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:57:28,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:57:28,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:57:28,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:57:28,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:57:28,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:57:28,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:57:28,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:57:28,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:57:28,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:57:28,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:57:28,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:57:28,530 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-RepeatedSemanticLbe.epf [2022-12-06 00:57:28,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:57:28,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:57:28,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:57:28,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:57:28,560 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:57:28,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:57:28,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:57:28,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:57:28,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:57:28,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:57:28,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:57:28,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:57:28,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:57:28,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:57:28,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:57:28,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:57:28,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:57:28,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:57:28,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:57:28,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:57:28,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:57:28,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:57:28,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:57:28,564 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 00:57:28,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:57:28,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:57:28,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:57:28,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:57:28,922 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:57:28,927 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-06 00:57:30,036 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:57:30,291 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:57:30,292 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-12-06 00:57:30,313 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c720516/64fc9aa640324b0f9b12dfd171d98dc6/FLAG9d9c84983 [2022-12-06 00:57:30,329 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c720516/64fc9aa640324b0f9b12dfd171d98dc6 [2022-12-06 00:57:30,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:57:30,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:57:30,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:57:30,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:57:30,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:57:30,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb83ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30, skipping insertion in model container [2022-12-06 00:57:30,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:57:30,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:57:30,504 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 00:57:30,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,640 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-06 00:57:30,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:57:30,665 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:57:30,679 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 00:57:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,701 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-06 00:57:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:57:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:57:30,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:57:30,743 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:57:30,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30 WrapperNode [2022-12-06 00:57:30,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:57:30,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:57:30,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:57:30,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:57:30,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,797 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-12-06 00:57:30,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:57:30,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:57:30,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:57:30,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:57:30,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:57:30,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:57:30,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:57:30,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:57:30,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (1/1) ... [2022-12-06 00:57:30,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:57:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:57:30,882 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-06 00:57:30,905 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-06 00:57:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:57:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:57:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:57:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:57:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-12-06 00:57:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-12-06 00:57:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:57:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:57:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:57:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:57:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:57:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:57:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-12-06 00:57:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-12-06 00:57:30,926 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:57:31,090 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:57:31,094 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:57:31,311 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:57:31,343 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:57:31,343 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:57:31,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:57:31 BoogieIcfgContainer [2022-12-06 00:57:31,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:57:31,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:57:31,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:57:31,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:57:31,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:57:30" (1/3) ... [2022-12-06 00:57:31,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e603c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:57:31, skipping insertion in model container [2022-12-06 00:57:31,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:57:30" (2/3) ... [2022-12-06 00:57:31,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e603c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:57:31, skipping insertion in model container [2022-12-06 00:57:31,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:57:31" (3/3) ... [2022-12-06 00:57:31,352 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-12-06 00:57:31,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:57:31,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:57:31,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:57:31,484 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 00:57:31,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 252 flow [2022-12-06 00:57:31,602 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 00:57:31,602 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:57:31,608 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-06 00:57:31,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 252 flow [2022-12-06 00:57:31,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 207 flow [2022-12-06 00:57:31,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:31,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 93 transitions, 207 flow [2022-12-06 00:57:31,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 93 transitions, 207 flow [2022-12-06 00:57:31,683 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2022-12-06 00:57:31,683 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:57:31,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 93 events. 2/93 cut-off events. For 3/3 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/89 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 00:57:31,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 93 transitions, 207 flow [2022-12-06 00:57:31,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 2574 [2022-12-06 00:57:35,255 INFO L203 LiptonReduction]: Total number of compositions: 66 [2022-12-06 00:57:35,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:57:35,275 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=REPEATED_LIPTON_PN, 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;@10385c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:57:35,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 00:57:35,280 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 00:57:35,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:57:35,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:35,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:35,282 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-06 00:57:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1290161535, now seen corresponding path program 1 times [2022-12-06 00:57:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:35,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181930221] [2022-12-06 00:57:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:35,601 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-06 00:57:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:35,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181930221] [2022-12-06 00:57:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181930221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:35,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:35,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:57:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051292713] [2022-12-06 00:57:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:35,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:57:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:57:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:57:35,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 43 [2022-12-06 00:57:35,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 00:57:35,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:35,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 43 [2022-12-06 00:57:35,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:38,271 INFO L130 PetriNetUnfolder]: 22597/31285 cut-off events. [2022-12-06 00:57:38,271 INFO L131 PetriNetUnfolder]: For 2892/2892 co-relation queries the response was YES. [2022-12-06 00:57:38,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64097 conditions, 31285 events. 22597/31285 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 175899 event pairs, 3815 based on Foata normal form. 0/28703 useless extension candidates. Maximal degree in co-relation 50361. Up to 15761 conditions per place. [2022-12-06 00:57:38,477 INFO L137 encePairwiseOnDemand]: 32/43 looper letters, 161 selfloop transitions, 26 changer transitions 7/196 dead transitions. [2022-12-06 00:57:38,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 196 transitions, 864 flow [2022-12-06 00:57:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:57:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:57:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2022-12-06 00:57:38,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2022-12-06 00:57:38,497 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2022-12-06 00:57:38,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:38,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 196 transitions, 864 flow [2022-12-06 00:57:38,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 196 transitions, 864 flow [2022-12-06 00:57:38,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 00:57:38,685 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:38,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:57:38,688 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 196 transitions, 864 flow [2022-12-06 00:57:38,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 00:57:38,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:38,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:38,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:57:38,691 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-06 00:57:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1555327116, now seen corresponding path program 1 times [2022-12-06 00:57:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199174558] [2022-12-06 00:57:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:38,875 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-06 00:57:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199174558] [2022-12-06 00:57:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199174558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:38,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:57:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712615762] [2022-12-06 00:57:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:38,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:57:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:57:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:57:38,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2022-12-06 00:57:38,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 196 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06 00:57:38,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:38,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2022-12-06 00:57:38,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:40,614 INFO L130 PetriNetUnfolder]: 15181/22204 cut-off events. [2022-12-06 00:57:40,614 INFO L131 PetriNetUnfolder]: For 10433/10433 co-relation queries the response was YES. [2022-12-06 00:57:40,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60659 conditions, 22204 events. 15181/22204 cut-off events. For 10433/10433 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 135094 event pairs, 1981 based on Foata normal form. 1532/23414 useless extension candidates. Maximal degree in co-relation 58704. Up to 10829 conditions per place. [2022-12-06 00:57:40,745 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 194 selfloop transitions, 30 changer transitions 12/290 dead transitions. [2022-12-06 00:57:40,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 290 transitions, 1780 flow [2022-12-06 00:57:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:57:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:57:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-06 00:57:40,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7154471544715447 [2022-12-06 00:57:40,748 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2022-12-06 00:57:40,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:40,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 290 transitions, 1780 flow [2022-12-06 00:57:40,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 290 transitions, 1780 flow [2022-12-06 00:57:40,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 802 [2022-12-06 00:57:40,860 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:40,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 00:57:40,861 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 290 transitions, 1780 flow [2022-12-06 00:57:40,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06 00:57:40,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:40,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:57:40,862 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-06 00:57:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1501056, now seen corresponding path program 2 times [2022-12-06 00:57:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348526244] [2022-12-06 00:57:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:40,988 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-06 00:57:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348526244] [2022-12-06 00:57:40,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348526244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:40,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:40,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:57:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057239270] [2022-12-06 00:57:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:40,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:57:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:40,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:57:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:57:40,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2022-12-06 00:57:40,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 290 transitions, 1780 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 00:57:40,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:40,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2022-12-06 00:57:40,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:41,854 INFO L130 PetriNetUnfolder]: 5110/8592 cut-off events. [2022-12-06 00:57:41,854 INFO L131 PetriNetUnfolder]: For 11123/11123 co-relation queries the response was YES. [2022-12-06 00:57:41,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29937 conditions, 8592 events. 5110/8592 cut-off events. For 11123/11123 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 55931 event pairs, 383 based on Foata normal form. 1232/9552 useless extension candidates. Maximal degree in co-relation 27409. Up to 4244 conditions per place. [2022-12-06 00:57:41,907 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 204 selfloop transitions, 45 changer transitions 77/379 dead transitions. [2022-12-06 00:57:41,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 379 transitions, 3026 flow [2022-12-06 00:57:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:57:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:57:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-12-06 00:57:41,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.774390243902439 [2022-12-06 00:57:41,911 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2022-12-06 00:57:41,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:41,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 379 transitions, 3026 flow [2022-12-06 00:57:42,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 379 transitions, 3026 flow [2022-12-06 00:57:42,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 1006 [2022-12-06 00:57:42,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:42,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 00:57:42,043 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 379 transitions, 3026 flow [2022-12-06 00:57:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 00:57:42,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:42,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:42,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:57:42,043 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-06 00:57:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1529617941, now seen corresponding path program 1 times [2022-12-06 00:57:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:42,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430829123] [2022-12-06 00:57:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:42,112 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-06 00:57:42,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:42,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430829123] [2022-12-06 00:57:42,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430829123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:42,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:42,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:57:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465136947] [2022-12-06 00:57:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:42,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:57:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:57:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:57:42,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 00:57:42,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 379 transitions, 3026 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06 00:57:42,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:42,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 00:57:42,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:43,346 INFO L130 PetriNetUnfolder]: 5661/9549 cut-off events. [2022-12-06 00:57:43,346 INFO L131 PetriNetUnfolder]: For 10068/10068 co-relation queries the response was YES. [2022-12-06 00:57:43,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42550 conditions, 9549 events. 5661/9549 cut-off events. For 10068/10068 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 63321 event pairs, 91 based on Foata normal form. 326/9615 useless extension candidates. Maximal degree in co-relation 39310. Up to 4421 conditions per place. [2022-12-06 00:57:43,402 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 461 selfloop transitions, 55 changer transitions 234/752 dead transitions. [2022-12-06 00:57:43,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 752 transitions, 7576 flow [2022-12-06 00:57:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:57:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:57:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2022-12-06 00:57:43,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2022-12-06 00:57:43,405 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2022-12-06 00:57:43,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:43,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 752 transitions, 7576 flow [2022-12-06 00:57:43,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 752 transitions, 7576 flow [2022-12-06 00:57:43,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-06 00:57:43,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:43,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 00:57:43,479 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 752 transitions, 7576 flow [2022-12-06 00:57:43,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06 00:57:43,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:43,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:43,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:57:43,480 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-06 00:57:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2019829180, now seen corresponding path program 1 times [2022-12-06 00:57:43,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:43,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513354691] [2022-12-06 00:57:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:43,531 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-06 00:57:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513354691] [2022-12-06 00:57:43,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513354691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:43,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:43,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:57:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528647294] [2022-12-06 00:57:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:57:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:57:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:57:43,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 00:57:43,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 752 transitions, 7576 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 00:57:43,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:43,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 00:57:43,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:45,076 INFO L130 PetriNetUnfolder]: 5620/9502 cut-off events. [2022-12-06 00:57:45,076 INFO L131 PetriNetUnfolder]: For 9235/9235 co-relation queries the response was YES. [2022-12-06 00:57:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51761 conditions, 9502 events. 5620/9502 cut-off events. For 9235/9235 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 62982 event pairs, 91 based on Foata normal form. 70/9312 useless extension candidates. Maximal degree in co-relation 47830. Up to 4775 conditions per place. [2022-12-06 00:57:45,122 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 498 selfloop transitions, 57 changer transitions 263/820 dead transitions. [2022-12-06 00:57:45,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 820 transitions, 9901 flow [2022-12-06 00:57:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:57:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:57:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2022-12-06 00:57:45,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5888501742160279 [2022-12-06 00:57:45,131 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2022-12-06 00:57:45,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:45,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 820 transitions, 9901 flow [2022-12-06 00:57:45,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 820 transitions, 9901 flow [2022-12-06 00:57:45,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 1930 [2022-12-06 00:57:45,201 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:45,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 00:57:45,202 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 820 transitions, 9901 flow [2022-12-06 00:57:45,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 00:57:45,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:45,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:57:45,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:57:45,202 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-06 00:57:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2005096566, now seen corresponding path program 1 times [2022-12-06 00:57:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236715780] [2022-12-06 00:57:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:45,278 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-06 00:57:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:45,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236715780] [2022-12-06 00:57:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236715780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:45,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:45,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:57:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725604720] [2022-12-06 00:57:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:57:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:57:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:57:45,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 00:57:45,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 820 transitions, 9901 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 00:57:45,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:45,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 00:57:45,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:46,648 INFO L130 PetriNetUnfolder]: 5551/9411 cut-off events. [2022-12-06 00:57:46,648 INFO L131 PetriNetUnfolder]: For 9281/9281 co-relation queries the response was YES. [2022-12-06 00:57:46,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60590 conditions, 9411 events. 5551/9411 cut-off events. For 9281/9281 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 62030 event pairs, 85 based on Foata normal form. 78/9229 useless extension candidates. Maximal degree in co-relation 55993. Up to 4972 conditions per place. [2022-12-06 00:57:46,711 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 533 selfloop transitions, 59 changer transitions 296/890 dead transitions. [2022-12-06 00:57:46,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 890 transitions, 12529 flow [2022-12-06 00:57:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:57:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:57:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-12-06 00:57:46,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 00:57:46,714 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2022-12-06 00:57:46,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:46,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 890 transitions, 12529 flow [2022-12-06 00:57:46,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 890 transitions, 12529 flow [2022-12-06 00:57:46,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 2058 [2022-12-06 00:57:46,818 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:46,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 00:57:46,819 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 890 transitions, 12529 flow [2022-12-06 00:57:46,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 00:57:46,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:46,820 INFO L213 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] [2022-12-06 00:57:46,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:57:46,820 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-06 00:57:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1549684386, now seen corresponding path program 1 times [2022-12-06 00:57:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:46,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146340149] [2022-12-06 00:57:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:46,933 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-06 00:57:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:46,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146340149] [2022-12-06 00:57:46,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146340149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:46,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:46,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:57:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35470635] [2022-12-06 00:57:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:46,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:57:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:57:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:57:46,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-06 00:57:46,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 890 transitions, 12529 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-06 00:57:46,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:46,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-06 00:57:46,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:48,441 INFO L130 PetriNetUnfolder]: 5688/10022 cut-off events. [2022-12-06 00:57:48,441 INFO L131 PetriNetUnfolder]: For 16253/16253 co-relation queries the response was YES. [2022-12-06 00:57:48,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72009 conditions, 10022 events. 5688/10022 cut-off events. For 16253/16253 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 70204 event pairs, 93 based on Foata normal form. 260/10022 useless extension candidates. Maximal degree in co-relation 66538. Up to 5505 conditions per place. [2022-12-06 00:57:48,492 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 408 selfloop transitions, 57 changer transitions 539/1088 dead transitions. [2022-12-06 00:57:48,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1088 transitions, 17451 flow [2022-12-06 00:57:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:57:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:57:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2022-12-06 00:57:48,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5880758807588076 [2022-12-06 00:57:48,496 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2022-12-06 00:57:48,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:48,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 1088 transitions, 17451 flow [2022-12-06 00:57:48,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 1088 transitions, 17451 flow [2022-12-06 00:57:48,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 2474 [2022-12-06 00:57:48,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:48,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 00:57:48,768 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 1088 transitions, 17451 flow [2022-12-06 00:57:48,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-06 00:57:48,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:48,769 INFO L213 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] [2022-12-06 00:57:48,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:57:48,769 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-06 00:57:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2066513906, now seen corresponding path program 2 times [2022-12-06 00:57:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:48,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308581200] [2022-12-06 00:57:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:48,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:57:48,867 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-06 00:57:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:57:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308581200] [2022-12-06 00:57:48,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308581200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:57:48,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:57:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:57:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501778921] [2022-12-06 00:57:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:57:48,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:57:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:57:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:57:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:57:48,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-06 00:57:48,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1088 transitions, 17451 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-06 00:57:48,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:57:48,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-06 00:57:48,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:57:51,117 INFO L130 PetriNetUnfolder]: 5953/10647 cut-off events. [2022-12-06 00:57:51,117 INFO L131 PetriNetUnfolder]: For 27012/27012 co-relation queries the response was YES. [2022-12-06 00:57:51,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84301 conditions, 10647 events. 5953/10647 cut-off events. For 27012/27012 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 76984 event pairs, 81 based on Foata normal form. 72/10459 useless extension candidates. Maximal degree in co-relation 77971. Up to 6057 conditions per place. [2022-12-06 00:57:51,164 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 426 selfloop transitions, 43 changer transitions 707/1260 dead transitions. [2022-12-06 00:57:51,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1260 transitions, 22675 flow [2022-12-06 00:57:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:57:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:57:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2022-12-06 00:57:51,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6432926829268293 [2022-12-06 00:57:51,171 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2022-12-06 00:57:51,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:57:51,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 1260 transitions, 22675 flow [2022-12-06 00:57:51,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 1260 transitions, 22675 flow [2022-12-06 00:57:51,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 2766 [2022-12-06 00:57:51,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:57:51,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 00:57:51,257 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 1260 transitions, 22675 flow [2022-12-06 00:57:51,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-06 00:57:51,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:57:51,257 INFO L213 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] [2022-12-06 00:57:51,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:57:51,257 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-06 00:57:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:57:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1266509330, now seen corresponding path program 3 times [2022-12-06 00:57:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:57:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221404613] [2022-12-06 00:57:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:57:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:57:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:57:51,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 00:57:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:57:51,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 00:57:51,314 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 00:57:51,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 00:57:51,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 00:57:51,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 00:57:51,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 00:57:51,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 00:57:51,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 00:57:51,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 00:57:51,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:57:51,318 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-06 00:57:51,323 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:57:51,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:57:51,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:57:51 BasicIcfg [2022-12-06 00:57:51,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:57:51,393 INFO L158 Benchmark]: Toolchain (without parser) took 21060.24ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 171.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 612.5MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,394 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 197.1MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:57:51,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.80ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 150.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.32ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 147.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,394 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 197.1MB. Free memory was 147.8MB in the beginning and 146.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,395 INFO L158 Benchmark]: RCFGBuilder took 510.33ms. Allocated memory is still 197.1MB. Free memory was 146.7MB in the beginning and 130.5MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,395 INFO L158 Benchmark]: TraceAbstraction took 20045.92ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 129.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 570.6MB. Max. memory is 8.0GB. [2022-12-06 00:57:51,396 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.19ms. Allocated memory is still 197.1MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.80ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 150.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.32ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 147.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 197.1MB. Free memory was 147.8MB in the beginning and 146.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 510.33ms. Allocated memory is still 197.1MB. Free memory was 146.7MB in the beginning and 130.5MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20045.92ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 129.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 570.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 104 PlacesBefore, 54 PlacesAfterwards, 93 TransitionsBefore, 43 TransitionsAfterwards, 2574 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 35 ConcurrentYvCompositions, 0 ChoiceCompositions, 66 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3372, independent: 3178, independent conditional: 3178, independent unconditional: 0, dependent: 194, dependent conditional: 194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3372, independent: 3178, independent conditional: 0, independent unconditional: 3178, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3372, independent: 3178, independent conditional: 0, independent unconditional: 3178, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3372, independent: 3178, independent conditional: 0, independent unconditional: 3178, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1708, independent: 1663, independent conditional: 0, independent unconditional: 1663, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1708, independent: 1615, independent conditional: 0, independent unconditional: 1615, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3372, independent: 1515, independent conditional: 0, independent unconditional: 1515, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1708, unknown conditional: 0, unknown unconditional: 1708] , Statistics on independence cache: Total cache size (in pairs): 2983, Positive cache size: 2938, Positive conditional cache size: 0, Positive unconditional cache size: 2938, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 196 TransitionsBefore, 196 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 290 TransitionsBefore, 290 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 379 TransitionsBefore, 379 TransitionsAfterwards, 1006 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 752 TransitionsBefore, 752 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 820 TransitionsBefore, 820 TransitionsAfterwards, 1930 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2058 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 1088 TransitionsBefore, 1088 TransitionsAfterwards, 2474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 1260 TransitionsBefore, 1260 TransitionsAfterwards, 2766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-2, r=0, t1={5:0}, t2={7:0}, t3={6:0}, t4={8:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-1, r=0, t1={5:0}, t2={7:0}, t3={6:0}, t4={8:0}, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=0, r=0, t1={5:0}, t2={7:0}, t3={6:0}, t4={8:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=1, r=0, t1={5:0}, t2={7:0}, t3={6:0}, t4={8:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [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; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l [L745] 2 return 0; [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, 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: 19.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 743 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 743 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1803 IncrementalHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 61 mSDtfsCounter, 1803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22675occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 00:57:51,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...