/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:08:55,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:08:55,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:08:55,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:08:55,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:08:55,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:08:55,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:08:55,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:08:55,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:08:55,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:08:55,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:08:55,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:08:55,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:08:55,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:08:55,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:08:55,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:08:55,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:08:55,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:08:55,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:08:55,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:08:55,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:08:55,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:08:55,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:08:55,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:08:55,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:08:55,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:08:55,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:08:55,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:08:55,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:08:55,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:08:55,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:08:55,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:08:55,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:08:55,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:08:55,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:08:55,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:08:55,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:08:55,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:08:55,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:08:55,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:08:55,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:08:55,829 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:08:55,854 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:08:55,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:08:55,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:08:55,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:08:55,856 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:08:55,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:08:55,856 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:08:55,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:08:55,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:08:55,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:08:55,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:08:55,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:08:55,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:08:55,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:08:55,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:08:55,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:08:55,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:08:55,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:08:56,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:08:56,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:08:56,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:08:56,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:08:56,198 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:08:56,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2022-12-06 07:08:57,331 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:08:57,629 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:08:57,630 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2022-12-06 07:08:57,654 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3c06c75e/7eb436a4725344e886f7763e79011bd5/FLAG8d4b64f8f [2022-12-06 07:08:57,672 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3c06c75e/7eb436a4725344e886f7763e79011bd5 [2022-12-06 07:08:57,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:08:57,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:08:57,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:08:57,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:08:57,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:08:57,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:08:57" (1/1) ... [2022-12-06 07:08:57,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f982559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:57, skipping insertion in model container [2022-12-06 07:08:57,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:08:57" (1/1) ... [2022-12-06 07:08:57,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:08:57,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:08:57,921 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2022-12-06 07:08:58,263 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 07:08:58,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:08:58,275 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:08:58,282 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2022-12-06 07:08:58,311 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 07:08:58,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:08:58,380 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:08:58,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58 WrapperNode [2022-12-06 07:08:58,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:08:58,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:08:58,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:08:58,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:08:58,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,446 INFO L138 Inliner]: procedures = 354, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-12-06 07:08:58,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:08:58,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:08:58,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:08:58,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:08:58,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:08:58,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:08:58,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:08:58,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:08:58,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (1/1) ... [2022-12-06 07:08:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:08:58,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:08:58,570 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 07:08:58,590 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 07:08:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2022-12-06 07:08:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2022-12-06 07:08:58,608 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2022-12-06 07:08:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2022-12-06 07:08:58,608 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:08:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:08:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:08:58,610 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 07:08:58,873 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:08:58,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:08:59,040 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:08:59,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:08:59,046 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:08:59,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:08:59 BoogieIcfgContainer [2022-12-06 07:08:59,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:08:59,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:08:59,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:08:59,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:08:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:08:57" (1/3) ... [2022-12-06 07:08:59,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2fdf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:08:59, skipping insertion in model container [2022-12-06 07:08:59,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:58" (2/3) ... [2022-12-06 07:08:59,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2fdf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:08:59, skipping insertion in model container [2022-12-06 07:08:59,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:08:59" (3/3) ... [2022-12-06 07:08:59,053 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2022-12-06 07:08:59,066 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:08:59,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:08:59,066 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:08:59,122 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:08:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 192 flow [2022-12-06 07:08:59,210 INFO L130 PetriNetUnfolder]: 1/86 cut-off events. [2022-12-06 07:08:59,210 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:08:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 86 events. 1/86 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 07:08:59,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 88 transitions, 192 flow [2022-12-06 07:08:59,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 66 transitions, 138 flow [2022-12-06 07:08:59,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:08:59,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 66 transitions, 138 flow [2022-12-06 07:08:59,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 138 flow [2022-12-06 07:08:59,261 INFO L130 PetriNetUnfolder]: 0/66 cut-off events. [2022-12-06 07:08:59,262 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:59,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 66 events. 0/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 07:08:59,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 66 transitions, 138 flow [2022-12-06 07:08:59,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 07:09:01,944 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-06 07:09:01,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:01,968 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;@6f321370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:01,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:09:01,970 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 07:09:01,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:01,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:01,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:01,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 813012681, now seen corresponding path program 1 times [2022-12-06 07:09:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:01,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683006528] [2022-12-06 07:09:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:02,317 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 07:09:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:02,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683006528] [2022-12-06 07:09:02,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683006528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:02,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:02,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:09:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845138292] [2022-12-06 07:09:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:02,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:02,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 14 [2022-12-06 07:09:02,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:09:02,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:02,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 14 [2022-12-06 07:09:02,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:02,398 INFO L130 PetriNetUnfolder]: 31/92 cut-off events. [2022-12-06 07:09:02,399 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:09:02,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 92 events. 31/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 21 based on Foata normal form. 10/102 useless extension candidates. Maximal degree in co-relation 164. Up to 51 conditions per place. [2022-12-06 07:09:02,400 INFO L137 encePairwiseOnDemand]: 11/14 looper letters, 13 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2022-12-06 07:09:02,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 83 flow [2022-12-06 07:09:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 07:09:02,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 07:09:02,409 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 34 flow. Second operand 3 states and 27 transitions. [2022-12-06 07:09:02,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 83 flow [2022-12-06 07:09:02,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:02,412 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 40 flow [2022-12-06 07:09:02,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2022-12-06 07:09:02,416 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-06 07:09:02,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:02,416 INFO L89 Accepts]: Start accepts. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 07:09:02,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:02,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:02,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 07:09:02,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 07:09:02,422 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 07:09:02,422 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:09:02,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 14 events. 0/14 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 07:09:02,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 07:09:02,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 07:09:02,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:02,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 07:09:02,459 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 13 transitions, 38 flow [2022-12-06 07:09:02,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:09:02,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:02,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:02,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:02,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1640477973, now seen corresponding path program 1 times [2022-12-06 07:09:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018406746] [2022-12-06 07:09:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:02,566 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 07:09:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:02,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018406746] [2022-12-06 07:09:02,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018406746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:02,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:02,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13273764] [2022-12-06 07:09:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:02,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-06 07:09:02,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 07:09:02,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:02,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-06 07:09:02,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:02,604 INFO L130 PetriNetUnfolder]: 15/46 cut-off events. [2022-12-06 07:09:02,605 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 07:09:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 46 events. 15/46 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 4 based on Foata normal form. 10/56 useless extension candidates. Maximal degree in co-relation 104. Up to 29 conditions per place. [2022-12-06 07:09:02,605 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 10 selfloop transitions, 5 changer transitions 0/16 dead transitions. [2022-12-06 07:09:02,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 76 flow [2022-12-06 07:09:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 07:09:02,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 07:09:02,606 INFO L175 Difference]: Start difference. First operand has 21 places, 13 transitions, 38 flow. Second operand 3 states and 21 transitions. [2022-12-06 07:09:02,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 76 flow [2022-12-06 07:09:02,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 16 transitions, 74 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:02,607 INFO L231 Difference]: Finished difference. Result has 22 places, 13 transitions, 46 flow [2022-12-06 07:09:02,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=22, PETRI_TRANSITIONS=13} [2022-12-06 07:09:02,607 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-06 07:09:02,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:02,608 INFO L89 Accepts]: Start accepts. Operand has 22 places, 13 transitions, 46 flow [2022-12-06 07:09:02,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:02,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:02,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 13 transitions, 46 flow [2022-12-06 07:09:02,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 13 transitions, 46 flow [2022-12-06 07:09:02,611 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 07:09:02,611 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:09:02,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 15 events. 0/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 15 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 07:09:02,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 13 transitions, 46 flow [2022-12-06 07:09:02,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 07:09:02,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [266] $Ultimate##0-->L1357-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_167| |v_~#mut~0.base_91|))) (and (= v_~g~0_52 1) (= (select .cse0 |v_~#mut~0.offset_91|) 0) (= |v_f1Thread1of1ForFork0_~ptr#1.base_17| |v_f1Thread1of1ForFork0_#in~ptr#1.base_17|) (= |v_#pthreadsMutex_165| (store |v_#pthreadsMutex_167| |v_~#mut~0.base_91| (store .cse0 |v_~#mut~0.offset_91| 0))) (= |v_f1Thread1of1ForFork0_~ptr#1.offset_17| |v_f1Thread1of1ForFork0_#in~ptr#1.offset_17|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_167|, ~#mut~0.base=|v_~#mut~0.base_91|, ~#mut~0.offset=|v_~#mut~0.offset_91|, f1Thread1of1ForFork0_#in~ptr#1.base=|v_f1Thread1of1ForFork0_#in~ptr#1.base_17|, f1Thread1of1ForFork0_#in~ptr#1.offset=|v_f1Thread1of1ForFork0_#in~ptr#1.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_165|, ~#mut~0.base=|v_~#mut~0.base_91|, ~g~0=v_~g~0_52, f1Thread1of1ForFork0_#t~nondet4#1=|v_f1Thread1of1ForFork0_#t~nondet4#1_31|, ~#mut~0.offset=|v_~#mut~0.offset_91|, f1Thread1of1ForFork0_~ptr#1.offset=|v_f1Thread1of1ForFork0_~ptr#1.offset_17|, f1Thread1of1ForFork0_#in~ptr#1.base=|v_f1Thread1of1ForFork0_#in~ptr#1.base_17|, f1Thread1of1ForFork0_~ptr#1.base=|v_f1Thread1of1ForFork0_~ptr#1.base_17|, f1Thread1of1ForFork0_#in~ptr#1.offset=|v_f1Thread1of1ForFork0_#in~ptr#1.offset_17|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, f1Thread1of1ForFork0_#t~nondet4#1, f1Thread1of1ForFork0_~ptr#1.offset, f1Thread1of1ForFork0_~ptr#1.base] and [267] $Ultimate##0-->L1368: Formula: (let ((.cse0 (select |v_#pthreadsMutex_172| |v_~#mut~0.base_93|))) (and (= (select .cse0 |v_~#mut~0.offset_93|) 0) (= v_f2Thread1of1ForFork1_~ptr.base_29 |v_f2Thread1of1ForFork1_#in~ptr.base_29|) (= v_~g~0_54 0) (= (store |v_#pthreadsMutex_172| |v_~#mut~0.base_93| (store .cse0 |v_~#mut~0.offset_93| 1)) |v_#pthreadsMutex_171|) (= v_f2Thread1of1ForFork1_~ptr.offset_29 |v_f2Thread1of1ForFork1_#in~ptr.offset_29|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_172|, ~#mut~0.base=|v_~#mut~0.base_93|, f2Thread1of1ForFork1_#in~ptr.offset=|v_f2Thread1of1ForFork1_#in~ptr.offset_29|, ~#mut~0.offset=|v_~#mut~0.offset_93|, f2Thread1of1ForFork1_#in~ptr.base=|v_f2Thread1of1ForFork1_#in~ptr.base_29|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_171|, ~#mut~0.base=|v_~#mut~0.base_93|, f2Thread1of1ForFork1_#in~ptr.offset=|v_f2Thread1of1ForFork1_#in~ptr.offset_29|, f2Thread1of1ForFork1_#t~nondet7=|v_f2Thread1of1ForFork1_#t~nondet7_47|, ~g~0=v_~g~0_54, ~#mut~0.offset=|v_~#mut~0.offset_93|, f2Thread1of1ForFork1_~ptr.base=v_f2Thread1of1ForFork1_~ptr.base_29, f2Thread1of1ForFork1_#in~ptr.base=|v_f2Thread1of1ForFork1_#in~ptr.base_29|, f2Thread1of1ForFork1_~ptr.offset=v_f2Thread1of1ForFork1_~ptr.offset_29} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet7, ~g~0, f2Thread1of1ForFork1_~ptr.base, f2Thread1of1ForFork1_~ptr.offset] [2022-12-06 07:09:02,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [269] $Ultimate##0-->f2EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_183| |v_~#mut~0.base_97|))) (and (= v_~g~0_60 0) (= |v_f1Thread1of1ForFork0_~ptr#1.base_21| |v_f1Thread1of1ForFork0_#in~ptr#1.base_21|) (= v_f2Thread1of1ForFork1_~ptr.base_33 |v_f2Thread1of1ForFork1_#in~ptr.base_33|) (= v_f2Thread1of1ForFork1_~ptr.offset_33 |v_f2Thread1of1ForFork1_#in~ptr.offset_33|) (= |v_f2Thread1of1ForFork1_#res.base_27| 0) (= |v_#pthreadsMutex_181| (store |v_#pthreadsMutex_183| |v_~#mut~0.base_97| (store .cse0 |v_~#mut~0.offset_97| 0))) (= (select .cse0 |v_~#mut~0.offset_97|) 0) (= |v_f2Thread1of1ForFork1_#res.offset_27| 0) (= |v_f1Thread1of1ForFork0_~ptr#1.offset_21| |v_f1Thread1of1ForFork0_#in~ptr#1.offset_21|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_183|, ~#mut~0.base=|v_~#mut~0.base_97|, f2Thread1of1ForFork1_#in~ptr.offset=|v_f2Thread1of1ForFork1_#in~ptr.offset_33|, ~#mut~0.offset=|v_~#mut~0.offset_97|, f1Thread1of1ForFork0_#in~ptr#1.base=|v_f1Thread1of1ForFork0_#in~ptr#1.base_21|, f2Thread1of1ForFork1_#in~ptr.base=|v_f2Thread1of1ForFork1_#in~ptr.base_33|, f1Thread1of1ForFork0_#in~ptr#1.offset=|v_f1Thread1of1ForFork0_#in~ptr#1.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, f2Thread1of1ForFork1_#t~nondet7=|v_f2Thread1of1ForFork1_#t~nondet7_53|, ~g~0=v_~g~0_60, ~#mut~0.offset=|v_~#mut~0.offset_97|, f2Thread1of1ForFork1_#res.offset=|v_f2Thread1of1ForFork1_#res.offset_27|, f2Thread1of1ForFork1_~ptr.offset=v_f2Thread1of1ForFork1_~ptr.offset_33, f1Thread1of1ForFork0_~ptr#1.base=|v_f1Thread1of1ForFork0_~ptr#1.base_21|, ~#mut~0.base=|v_~#mut~0.base_97|, f2Thread1of1ForFork1_#in~ptr.offset=|v_f2Thread1of1ForFork1_#in~ptr.offset_33|, f1Thread1of1ForFork0_#t~nondet4#1=|v_f1Thread1of1ForFork0_#t~nondet4#1_35|, f2Thread1of1ForFork1_#res.base=|v_f2Thread1of1ForFork1_#res.base_27|, f2Thread1of1ForFork1_~ptr.base=v_f2Thread1of1ForFork1_~ptr.base_33, f1Thread1of1ForFork0_~ptr#1.offset=|v_f1Thread1of1ForFork0_~ptr#1.offset_21|, f1Thread1of1ForFork0_#in~ptr#1.base=|v_f1Thread1of1ForFork0_#in~ptr#1.base_21|, f2Thread1of1ForFork1_#in~ptr.base=|v_f2Thread1of1ForFork1_#in~ptr.base_33|, f1Thread1of1ForFork0_#in~ptr#1.offset=|v_f1Thread1of1ForFork0_#in~ptr#1.offset_21|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet7, ~g~0, f1Thread1of1ForFork0_#t~nondet4#1, f2Thread1of1ForFork1_#res.base, f2Thread1of1ForFork1_~ptr.base, f1Thread1of1ForFork0_~ptr#1.offset, f2Thread1of1ForFork1_#res.offset, f2Thread1of1ForFork1_~ptr.offset, f1Thread1of1ForFork0_~ptr#1.base] and [184] L1357-1-->L1357-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#mut~0.base_8|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#mut~0.base_8| (store .cse0 |v_~#mut~0.offset_8| 1))) (= (select .cse0 |v_~#mut~0.offset_8|) 0) (= |v_f1Thread1of1ForFork0_#t~nondet5#1_1| 0))) InVars {~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_4|, ~#mut~0.base=|v_~#mut~0.base_8|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_3|, ~#mut~0.base=|v_~#mut~0.base_8|, f1Thread1of1ForFork0_#t~nondet5#1=|v_f1Thread1of1ForFork0_#t~nondet5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet5#1] [2022-12-06 07:09:02,980 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:09:02,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 374 [2022-12-06 07:09:02,981 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 9 transitions, 36 flow [2022-12-06 07:09:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 07:09:02,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:02,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 07:09:02,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:02,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 277938521, now seen corresponding path program 1 times [2022-12-06 07:09:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017441481] [2022-12-06 07:09:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 07:09:02,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 07:09:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 07:09:03,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 07:09:03,021 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 07:09:03,021 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:09:03,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:09:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:09:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-12-06 07:09:03,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:09:03,023 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-06 07:09:03,027 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:09:03,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:09:03,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:09:03 BasicIcfg [2022-12-06 07:09:03,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:09:03,043 INFO L158 Benchmark]: Toolchain (without parser) took 5367.12ms. Allocated memory was 208.7MB in the beginning and 304.1MB in the end (delta: 95.4MB). Free memory was 182.9MB in the beginning and 207.2MB in the end (delta: -24.3MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:09:03,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.86ms. Allocated memory is still 208.7MB. Free memory was 182.9MB in the beginning and 144.7MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.52ms. Allocated memory is still 208.7MB. Free memory was 144.7MB in the beginning and 142.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,044 INFO L158 Benchmark]: Boogie Preprocessor took 65.28ms. Allocated memory is still 208.7MB. Free memory was 142.0MB in the beginning and 139.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,044 INFO L158 Benchmark]: RCFGBuilder took 534.87ms. Allocated memory is still 208.7MB. Free memory was 139.5MB in the beginning and 119.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,044 INFO L158 Benchmark]: TraceAbstraction took 3993.17ms. Allocated memory was 208.7MB in the beginning and 304.1MB in the end (delta: 95.4MB). Free memory was 119.5MB in the beginning and 207.2MB in the end (delta: -87.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:03,046 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.12ms. Allocated memory is still 208.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 704.86ms. Allocated memory is still 208.7MB. Free memory was 182.9MB in the beginning and 144.7MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.52ms. Allocated memory is still 208.7MB. Free memory was 144.7MB in the beginning and 142.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.28ms. Allocated memory is still 208.7MB. Free memory was 142.0MB in the beginning and 139.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.87ms. Allocated memory is still 208.7MB. Free memory was 139.5MB in the beginning and 119.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3993.17ms. Allocated memory was 208.7MB in the beginning and 304.1MB in the end (delta: 95.4MB). Free memory was 119.5MB in the beginning and 207.2MB in the end (delta: -87.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 73 PlacesBefore, 21 PlacesAfterwards, 66 TransitionsBefore, 14 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, independent: 305, independent conditional: 305, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 333, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 285, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 285, independent: 265, independent conditional: 0, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 285, unknown conditional: 0, unknown unconditional: 285] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 384, Positive conditional cache size: 0, Positive unconditional cache size: 384, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 22 PlacesBefore, 21 PlacesAfterwards, 14 TransitionsBefore, 13 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 4, independent unconditional: 49, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 22 PlacesBefore, 18 PlacesAfterwards, 13 TransitionsBefore, 9 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1150:1151}, argv={1150:1151}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-2, t1={6:0}, t2={5:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1150:1151}, argv={1150:1151}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=-1, ptr={0:0}, t1={6:0}, t2={5:0}] [L1356] 1 g = 1 [L1366] 1 g = 0 [L1369] 1 return ((void *)0); [L1358] CALL 1 __VERIFIER_assert(g == 1) [L19] COND TRUE 1 !(cond) [L19] 1 reach_error() VAL [\old(cond)=0, \result={0:0}, cond=0, cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0:0}] - UnprovableResult [Line: 1375]: 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: 1377]: 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 5 procedures, 118 locations, 4 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: 3.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 6, 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.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 07:09:03,074 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...