/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_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:09:00,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:09:00,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:09:00,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:09:00,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:09:00,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:09:00,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:09:00,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:09:00,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:09:00,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:09:00,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:09:00,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:09:00,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:09:00,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:09:00,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:09:00,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:09:00,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:09:00,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:09:00,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:09:00,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:09:00,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:09:00,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:09:00,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:09:00,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:09:00,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:09:00,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:09:00,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:09:00,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:09:00,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:09:00,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:09:00,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:09:00,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:09:00,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:09:00,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:09:00,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:09:00,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:09:00,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:09:00,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:09:00,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:09:00,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:09:00,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:09:00,249 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:09:00,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:09:00,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:09:00,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:09:00,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:09:00,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:09:00,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:09:00,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:00,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:09:00,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:09:00,277 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:09:00,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:09:00,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:09:00,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:09:00,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:09:00,666 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:09:00,667 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_unknown_1_pos.i [2022-12-06 07:09:01,642 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:09:01,847 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:09:01,848 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2022-12-06 07:09:01,862 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b91a97c/831441cce9de409faaad803e7a7cc79a/FLAG1b807b278 [2022-12-06 07:09:01,871 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b91a97c/831441cce9de409faaad803e7a7cc79a [2022-12-06 07:09:01,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:09:01,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:09:01,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:01,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:09:01,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:09:01,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:01" (1/1) ... [2022-12-06 07:09:01,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb63ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:01, skipping insertion in model container [2022-12-06 07:09:01,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:01" (1/1) ... [2022-12-06 07:09:01,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:09:01,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:09:02,026 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_unknown_1_pos.i[1103,1116] [2022-12-06 07:09:02,240 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 07:09:02,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:02,252 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:09:02,260 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_unknown_1_pos.i[1103,1116] [2022-12-06 07:09:02,301 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 07:09:02,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:02,358 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:09:02,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02 WrapperNode [2022-12-06 07:09:02,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:02,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:02,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:09:02,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:09:02,365 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:09:02" (1/1) ... [2022-12-06 07:09:02,391 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:09:02" (1/1) ... [2022-12-06 07:09:02,420 INFO L138 Inliner]: procedures = 354, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2022-12-06 07:09:02,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:02,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:09:02,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:09:02,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:09:02,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:09:02,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:09:02,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:09:02,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:09:02,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (1/1) ... [2022-12-06 07:09:02,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:02,509 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:09:02,526 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:09:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2022-12-06 07:09:02,539 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2022-12-06 07:09:02,539 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:09:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 07:09:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:09:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:09:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:09:02,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:09:02,541 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:09:02,744 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:09:02,746 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:09:02,864 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:09:02,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:09:02,873 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:09:02,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:02 BoogieIcfgContainer [2022-12-06 07:09:02,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:09:02,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:09:02,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:09:02,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:09:02,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:09:01" (1/3) ... [2022-12-06 07:09:02,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8e8796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:02, skipping insertion in model container [2022-12-06 07:09:02,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:02" (2/3) ... [2022-12-06 07:09:02,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8e8796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:02, skipping insertion in model container [2022-12-06 07:09:02,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:02" (3/3) ... [2022-12-06 07:09:02,893 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2022-12-06 07:09:02,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:09:02,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:09:02,908 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:09:02,945 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:09:02,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 192 flow [2022-12-06 07:09:03,000 INFO L130 PetriNetUnfolder]: 1/86 cut-off events. [2022-12-06 07:09:03,000 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:09:03,004 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 54 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-12-06 07:09:03,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 88 transitions, 192 flow [2022-12-06 07:09:03,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 70 transitions, 149 flow [2022-12-06 07:09:03,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:03,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 70 transitions, 149 flow [2022-12-06 07:09:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 70 transitions, 149 flow [2022-12-06 07:09:03,059 INFO L130 PetriNetUnfolder]: 0/70 cut-off events. [2022-12-06 07:09:03,059 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:09:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 70 events. 0/70 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 07:09:03,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 70 transitions, 149 flow [2022-12-06 07:09:03,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 07:09:06,677 INFO L203 LiptonReduction]: Total number of compositions: 59 [2022-12-06 07:09:06,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:06,704 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;@2918ed40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:06,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:09:06,707 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-06 07:09:06,707 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:09:06,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:06,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 07:09:06,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash 197933511, now seen corresponding path program 1 times [2022-12-06 07:09:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101908356] [2022-12-06 07:09:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:07,124 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:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:07,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101908356] [2022-12-06 07:09:07,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101908356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:07,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:07,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:09:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987298287] [2022-12-06 07:09:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:07,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 13 [2022-12-06 07:09:07,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:07,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:07,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 13 [2022-12-06 07:09:07,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:07,191 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-06 07:09:07,192 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:07,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 53 events. 17/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 10 based on Foata normal form. 6/59 useless extension candidates. Maximal degree in co-relation 85. Up to 31 conditions per place. [2022-12-06 07:09:07,193 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 12 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2022-12-06 07:09:07,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 76 flow [2022-12-06 07:09:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 07:09:07,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 07:09:07,203 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 35 flow. Second operand 3 states and 22 transitions. [2022-12-06 07:09:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 76 flow [2022-12-06 07:09:07,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 07:09:07,206 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 41 flow [2022-12-06 07:09:07,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2022-12-06 07:09:07,210 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-06 07:09:07,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:07,211 INFO L89 Accepts]: Start accepts. Operand has 20 places, 13 transitions, 41 flow [2022-12-06 07:09:07,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:07,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:07,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 13 transitions, 41 flow [2022-12-06 07:09:07,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 13 transitions, 41 flow [2022-12-06 07:09:07,219 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 07:09:07,219 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:09:07,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 16 events. 0/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 07:09:07,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 13 transitions, 41 flow [2022-12-06 07:09:07,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 07:09:07,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [270] L1357-->f1EXIT: Formula: (and (= |v_f1Thread1of1ForFork0_#res.offset_11| 0) (= |v_f1Thread1of1ForFork0_#res.base_11| 0) (= v_~g~0_45 0) (= (store |v_#pthreadsMutex_127| |v_~#mut~0.base_87| (store (select |v_#pthreadsMutex_127| |v_~#mut~0.base_87|) |v_~#mut~0.offset_87| 0)) |v_#pthreadsMutex_125|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_127|, ~#mut~0.base=|v_~#mut~0.base_87|, ~#mut~0.offset=|v_~#mut~0.offset_87|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_125|, ~#mut~0.base=|v_~#mut~0.base_87|, f1Thread1of1ForFork0_#t~nondet5=|v_f1Thread1of1ForFork0_#t~nondet5_25|, f1Thread1of1ForFork0_#res.offset=|v_f1Thread1of1ForFork0_#res.offset_11|, ~g~0=v_~g~0_45, ~#mut~0.offset=|v_~#mut~0.offset_87|, f1Thread1of1ForFork0_#t~nondet6=|v_f1Thread1of1ForFork0_#t~nondet6_13|, f1Thread1of1ForFork0_#res.base=|v_f1Thread1of1ForFork0_#res.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet5, f1Thread1of1ForFork0_#res.offset, ~g~0, f1Thread1of1ForFork0_#t~nondet6, f1Thread1of1ForFork0_#res.base] and [239] $Ultimate##0-->L1357: Formula: (let ((.cse0 (select |v_#pthreadsMutex_98| |v_~#mut~0.base_49|))) (and (= (select .cse0 |v_~#mut~0.offset_49|) 0) (= v_~g~0_19 1) (= |v_f1Thread1of1ForFork0_#in~ptr.base_9| v_f1Thread1of1ForFork0_~ptr.base_9) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#mut~0.base_49| (store .cse0 |v_~#mut~0.offset_49| 1))) (= |v_f1Thread1of1ForFork0_#in~ptr.offset_9| v_f1Thread1of1ForFork0_~ptr.offset_9))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#mut~0.base=|v_~#mut~0.base_49|, ~#mut~0.offset=|v_~#mut~0.offset_49|, f1Thread1of1ForFork0_#in~ptr.offset=|v_f1Thread1of1ForFork0_#in~ptr.offset_9|, f1Thread1of1ForFork0_#in~ptr.base=|v_f1Thread1of1ForFork0_#in~ptr.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#mut~0.base=|v_~#mut~0.base_49|, f1Thread1of1ForFork0_#t~nondet4=|v_f1Thread1of1ForFork0_#t~nondet4_17|, ~g~0=v_~g~0_19, f1Thread1of1ForFork0_~ptr.base=v_f1Thread1of1ForFork0_~ptr.base_9, ~#mut~0.offset=|v_~#mut~0.offset_49|, f1Thread1of1ForFork0_#in~ptr.offset=|v_f1Thread1of1ForFork0_#in~ptr.offset_9|, f1Thread1of1ForFork0_#in~ptr.base=|v_f1Thread1of1ForFork0_#in~ptr.base_9|, f1Thread1of1ForFork0_~ptr.offset=v_f1Thread1of1ForFork0_~ptr.offset_9} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet4, ~g~0, f1Thread1of1ForFork0_~ptr.base, f1Thread1of1ForFork0_~ptr.offset] [2022-12-06 07:09:07,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:07,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:09:07,299 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 44 flow [2022-12-06 07:09:07,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:07,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:07,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:07,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:07,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1840971304, now seen corresponding path program 1 times [2022-12-06 07:09:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:07,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898972328] [2022-12-06 07:09:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:07,410 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:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:07,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898972328] [2022-12-06 07:09:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898972328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:07,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:07,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588678335] [2022-12-06 07:09:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:07,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-06 07:09:07,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:07,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:07,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-06 07:09:07,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:07,460 INFO L130 PetriNetUnfolder]: 9/29 cut-off events. [2022-12-06 07:09:07,460 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:09:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 29 events. 9/29 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 3 based on Foata normal form. 4/33 useless extension candidates. Maximal degree in co-relation 26. Up to 16 conditions per place. [2022-12-06 07:09:07,461 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 9 selfloop transitions, 3 changer transitions 1/13 dead transitions. [2022-12-06 07:09:07,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 13 transitions, 63 flow [2022-12-06 07:09:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-12-06 07:09:07,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 07:09:07,462 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 44 flow. Second operand 3 states and 17 transitions. [2022-12-06 07:09:07,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 13 transitions, 63 flow [2022-12-06 07:09:07,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 13 transitions, 59 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:07,465 INFO L231 Difference]: Finished difference. Result has 17 places, 9 transitions, 31 flow [2022-12-06 07:09:07,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=31, PETRI_PLACES=17, PETRI_TRANSITIONS=9} [2022-12-06 07:09:07,465 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -3 predicate places. [2022-12-06 07:09:07,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:07,465 INFO L89 Accepts]: Start accepts. Operand has 17 places, 9 transitions, 31 flow [2022-12-06 07:09:07,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:07,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:07,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 9 transitions, 31 flow [2022-12-06 07:09:07,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 9 transitions, 31 flow [2022-12-06 07:09:07,472 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-06 07:09:07,472 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:07,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 10 events. 0/10 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 07:09:07,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 9 transitions, 31 flow [2022-12-06 07:09:07,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 07:09:07,555 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:09:07,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:09:07,557 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 7 transitions, 25 flow [2022-12-06 07:09:07,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:07,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:07,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 07:09:07,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:07,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 198339319, now seen corresponding path program 1 times [2022-12-06 07:09:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:07,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023293193] [2022-12-06 07:09:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 07:09:07,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 07:09:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 07:09:07,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 07:09:07,661 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 07:09:07,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:09:07,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:09:07,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:09:07,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-12-06 07:09:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:09:07,666 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-06 07:09:07,671 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:09:07,671 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:09:07,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:09:07 BasicIcfg [2022-12-06 07:09:07,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:09:07,700 INFO L158 Benchmark]: Toolchain (without parser) took 5826.66ms. Allocated memory was 196.1MB in the beginning and 284.2MB in the end (delta: 88.1MB). Free memory was 169.8MB in the beginning and 250.2MB in the end (delta: -80.3MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,701 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:09:07,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.09ms. Allocated memory is still 196.1MB. Free memory was 169.3MB in the beginning and 131.0MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.52ms. Allocated memory is still 196.1MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,704 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 196.1MB. Free memory was 128.4MB in the beginning and 125.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,705 INFO L158 Benchmark]: RCFGBuilder took 417.10ms. Allocated memory is still 196.1MB. Free memory was 125.8MB in the beginning and 106.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,705 INFO L158 Benchmark]: TraceAbstraction took 4811.65ms. Allocated memory was 235.9MB in the beginning and 284.2MB in the end (delta: 48.2MB). Free memory was 210.7MB in the beginning and 250.2MB in the end (delta: -39.4MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-12-06 07:09:07,706 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.11ms. Allocated memory is still 196.1MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.09ms. Allocated memory is still 196.1MB. Free memory was 169.3MB in the beginning and 131.0MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.52ms. Allocated memory is still 196.1MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 196.1MB. Free memory was 128.4MB in the beginning and 125.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.10ms. Allocated memory is still 196.1MB. Free memory was 125.8MB in the beginning and 106.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4811.65ms. Allocated memory was 235.9MB in the beginning and 284.2MB in the end (delta: 48.2MB). Free memory was 210.7MB in the beginning and 250.2MB in the end (delta: -39.4MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 77 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 13 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 25 ConcurrentYvCompositions, 0 ChoiceCompositions, 59 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 343, independent conditional: 343, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 320, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 320, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 366, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 320, unknown conditional: 0, unknown unconditional: 320] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 508, Positive conditional cache size: 0, Positive unconditional cache size: 508, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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.1s, 20 PlacesBefore, 20 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 16 PlacesBefore, 14 PlacesAfterwards, 9 TransitionsBefore, 7 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-1, ptr={0:0}, t1={6:0}, t2={5:0}] [L1356] 1 g = 1 [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=0, ptr={0:0}, ptr={0:0}, t1={6:0}, t2={5:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) [L19] 2 reach_error() VAL [\old(cond)=0, cond={4:0}, cond=0, g=1, 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: 4.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=1, 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 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:07,739 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...