/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:57:46,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:57:46,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:57:46,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:57:46,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:57:46,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:57:46,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:57:46,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:57:46,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:57:46,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:57:46,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:57:46,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:57:46,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:57:46,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:57:46,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:57:46,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:57:46,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:57:46,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:57:46,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:57:46,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:57:46,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:57:46,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:57:46,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:57:46,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:57:46,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:57:46,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:57:46,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:57:46,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:57:46,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:57:46,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:57:46,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:57:46,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:57:46,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:57:46,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:57:46,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:57:46,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:57:46,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:57:46,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:57:46,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:57:46,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:57:46,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:57:46,994 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:57:47,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:57:47,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:57:47,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:57:47,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:57:47,024 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:57:47,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:57:47,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:57:47,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:57:47,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:57:47,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:57:47,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:57:47,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:57:47,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:57:47,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:57:47,027 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 04:57:47,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:57:47,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:57:47,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:57:47,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:57:47,302 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:57:47,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.i [2022-12-06 04:57:48,333 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:57:48,573 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:57:48,574 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.i [2022-12-06 04:57:48,589 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8870e9da/97d3648837414620a2c97a7628dd1de5/FLAGbf2f2a099 [2022-12-06 04:57:48,610 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8870e9da/97d3648837414620a2c97a7628dd1de5 [2022-12-06 04:57:48,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:57:48,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:57:48,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:57:48,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:57:48,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:57:48,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:48,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c1955d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48, skipping insertion in model container [2022-12-06 04:57:48,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:48,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:57:48,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:57:48,793 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_19-publish-precision_unknown_1_pos.i[1103,1116] [2022-12-06 04:57:48,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:57:48,925 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:57:48,935 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_19-publish-precision_unknown_1_pos.i[1103,1116] [2022-12-06 04:57:48,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:57:48,982 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:57:48,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48 WrapperNode [2022-12-06 04:57:48,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:57:48,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:57:48,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:57:48,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:57:48,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,018 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-06 04:57:49,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:57:49,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:57:49,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:57:49,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:57:49,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:57:49,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:57:49,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:57:49,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:57:49,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (1/1) ... [2022-12-06 04:57:49,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:57:49,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:57:49,056 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 04:57:49,071 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 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-06 04:57:49,091 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:57:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:57:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:57:49,092 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 04:57:49,184 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:57:49,185 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:57:49,333 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:57:49,337 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:57:49,337 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:57:49,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:57:49 BoogieIcfgContainer [2022-12-06 04:57:49,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:57:49,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:57:49,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:57:49,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:57:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:57:48" (1/3) ... [2022-12-06 04:57:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b547e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:57:49, skipping insertion in model container [2022-12-06 04:57:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:57:48" (2/3) ... [2022-12-06 04:57:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b547e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:57:49, skipping insertion in model container [2022-12-06 04:57:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:57:49" (3/3) ... [2022-12-06 04:57:49,351 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_unknown_1_pos.i [2022-12-06 04:57:49,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:57:49,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:57:49,362 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:57:49,419 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-06 04:57:49,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 138 flow [2022-12-06 04:57:49,488 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-12-06 04:57:49,489 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:57:49,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 1/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2022-12-06 04:57:49,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 138 flow [2022-12-06 04:57:49,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 52 transitions, 107 flow [2022-12-06 04:57:49,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:57:49,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 107 flow [2022-12-06 04:57:49,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 107 flow [2022-12-06 04:57:49,539 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-12-06 04:57:49,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:57:49,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 52 events. 0/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:57:49,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 107 flow [2022-12-06 04:57:49,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 04:57:51,757 INFO L203 LiptonReduction]: Total number of compositions: 45 [2022-12-06 04:57:51,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:57:51,772 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;@5ce2a8b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:57:51,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-06 04:57:51,773 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:57:51,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:57:51,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:57:51,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:57:51,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:57:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:57:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 6882470, now seen corresponding path program 1 times [2022-12-06 04:57:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:57:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419208643] [2022-12-06 04:57:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:57:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:57:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:57:51,981 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 04:57:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:57:51,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419208643] [2022-12-06 04:57:51,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419208643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:57:51,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:57:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:57:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514736419] [2022-12-06 04:57:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:57:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:57:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:57:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:57:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:57:52,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 10 [2022-12-06 04:57:52,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 10 transitions, 23 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 04:57:52,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:57:52,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 10 [2022-12-06 04:57:52,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:57:52,026 INFO L130 PetriNetUnfolder]: 4/21 cut-off events. [2022-12-06 04:57:52,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:57:52,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 4/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 3 based on Foata normal form. 4/23 useless extension candidates. Maximal degree in co-relation 35. Up to 14 conditions per place. [2022-12-06 04:57:52,028 INFO L137 encePairwiseOnDemand]: 6/10 looper letters, 5 selfloop transitions, 3 changer transitions 2/11 dead transitions. [2022-12-06 04:57:52,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 43 flow [2022-12-06 04:57:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:57:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:57:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-12-06 04:57:52,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:57:52,037 INFO L175 Difference]: Start difference. First operand has 14 places, 10 transitions, 23 flow. Second operand 3 states and 16 transitions. [2022-12-06 04:57:52,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 43 flow [2022-12-06 04:57:52,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 42 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:57:52,041 INFO L231 Difference]: Finished difference. Result has 16 places, 8 transitions, 29 flow [2022-12-06 04:57:52,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=13, 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=29, PETRI_PLACES=16, PETRI_TRANSITIONS=8} [2022-12-06 04:57:52,045 INFO L294 CegarLoopForPetriNet]: 14 programPoint places, 2 predicate places. [2022-12-06 04:57:52,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:57:52,046 INFO L89 Accepts]: Start accepts. Operand has 16 places, 8 transitions, 29 flow [2022-12-06 04:57:52,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:57:52,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:57:52,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 8 transitions, 29 flow [2022-12-06 04:57:52,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 8 transitions, 29 flow [2022-12-06 04:57:52,054 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-06 04:57:52,054 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:57:52,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 10 events. 0/10 cut-off events. For 1/1 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/10 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:57:52,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 8 transitions, 29 flow [2022-12-06 04:57:52,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 04:57:52,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [196] L688-->L692: Formula: (and (= v_~glob1~0_70 0) (= |v_#pthreadsMutex_199| (store |v_#pthreadsMutex_201| |v_~#mutex2~0.base_99| (store (select |v_#pthreadsMutex_201| |v_~#mutex2~0.base_99|) |v_~#mutex2~0.offset_99| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_201|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_99|, ~#mutex2~0.base=|v_~#mutex2~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_199|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_99|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_35|, ~glob1~0=v_~glob1~0_70, ~#mutex2~0.base=|v_~#mutex2~0.base_99|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet3, ~glob1~0] and [175] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_116| |v_~#mutex1~0.base_33|))) (let ((.cse0 (store |v_#pthreadsMutex_116| |v_~#mutex1~0.base_33| (store .cse2 |v_~#mutex1~0.offset_33| 1)))) (let ((.cse1 (select .cse0 |v_~#mutex2~0.base_55|))) (and (= (store .cse0 |v_~#mutex2~0.base_55| (store .cse1 |v_~#mutex2~0.offset_55| 1)) |v_#pthreadsMutex_115|) (= v_~glob1~0_20 5) (= v_t_funThread1of1ForFork0_~arg.base_13 |v_t_funThread1of1ForFork0_#in~arg.base_13|) (= (select .cse2 |v_~#mutex1~0.offset_33|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_13| v_t_funThread1of1ForFork0_~arg.offset_13) (= (select .cse1 |v_~#mutex2~0.offset_55|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_33|, ~#mutex1~0.base=|v_~#mutex1~0.base_33|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_55|, ~#mutex2~0.base=|v_~#mutex2~0.base_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_33|, ~#mutex1~0.base=|v_~#mutex1~0.base_33|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_13, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_21|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_13|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_55|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_13, ~glob1~0=v_~glob1~0_20, ~#mutex2~0.base=|v_~#mutex2~0.base_55|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, ~glob1~0] [2022-12-06 04:57:52,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [197] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_243| |v_~#mutex2~0.base_113| (store (select |v_#pthreadsMutex_243| |v_~#mutex2~0.base_113|) |v_~#mutex2~0.offset_113| 0)))) (let ((.cse2 (select .cse3 |v_~#mutex1~0.base_69|))) (let ((.cse0 (store .cse3 |v_~#mutex1~0.base_69| (store .cse2 |v_~#mutex1~0.offset_69| 1)))) (let ((.cse1 (select .cse0 |v_~#mutex2~0.base_113|))) (and (= v_~glob1~0_80 5) (= v_t_funThread1of1ForFork0_~arg.base_21 |v_t_funThread1of1ForFork0_#in~arg.base_21|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_21| v_t_funThread1of1ForFork0_~arg.offset_21) (= (store .cse0 |v_~#mutex2~0.base_113| (store .cse1 |v_~#mutex2~0.offset_113| 1)) |v_#pthreadsMutex_241|) (= (select .cse2 |v_~#mutex1~0.offset_69|) 0) (= (select .cse1 |v_~#mutex2~0.offset_113|) 0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_243|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_69|, ~#mutex1~0.base=|v_~#mutex1~0.base_69|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_21|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_113|, ~#mutex2~0.base=|v_~#mutex2~0.base_113|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_241|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_69|, ~#mutex1~0.base=|v_~#mutex1~0.base_69|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_21|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_21, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_21|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_21, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_29|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_23|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_113|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_43|, ~glob1~0=v_~glob1~0_80, ~#mutex2~0.base=|v_~#mutex2~0.base_113|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, ~glob1~0] and [178] L692-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_126| |v_~#mutex1~0.base_39| (store (select |v_#pthreadsMutex_126| |v_~#mutex1~0.base_39|) |v_~#mutex1~0.offset_39| 0)) |v_#pthreadsMutex_125|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_126|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_39|, ~#mutex1~0.base=|v_~#mutex1~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_125|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_39|, ~#mutex1~0.base=|v_~#mutex1~0.base_39|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-06 04:57:52,189 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:57:52,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 04:57:52,190 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 7 transitions, 30 flow [2022-12-06 04:57:52,190 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 04:57:52,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:57:52,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:57:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:57:52,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:57:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:57:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 213356265, now seen corresponding path program 1 times [2022-12-06 04:57:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:57:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663622337] [2022-12-06 04:57:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:57:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:57:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:57:52,340 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 04:57:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:57:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663622337] [2022-12-06 04:57:52,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663622337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:57:52,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:57:52,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:57:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260497548] [2022-12-06 04:57:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:57:52,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:57:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:57:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:57:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:57:52,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 7 [2022-12-06 04:57:52,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 7 transitions, 30 flow. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 04:57:52,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:57:52,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 7 [2022-12-06 04:57:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:57:52,355 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:57:52,356 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:57:52,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 7 events. 0/7 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 2/9 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 04:57:52,356 INFO L137 encePairwiseOnDemand]: 3/7 looper letters, 2 selfloop transitions, 4 changer transitions 0/6 dead transitions. [2022-12-06 04:57:52,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 6 transitions, 34 flow [2022-12-06 04:57:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:57:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:57:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-12-06 04:57:52,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 04:57:52,358 INFO L175 Difference]: Start difference. First operand has 13 places, 7 transitions, 30 flow. Second operand 4 states and 8 transitions. [2022-12-06 04:57:52,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 6 transitions, 34 flow [2022-12-06 04:57:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 30 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:57:52,358 INFO L231 Difference]: Finished difference. Result has 13 places, 6 transitions, 26 flow [2022-12-06 04:57:52,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=7, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=26, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2022-12-06 04:57:52,359 INFO L294 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2022-12-06 04:57:52,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:57:52,359 INFO L89 Accepts]: Start accepts. Operand has 13 places, 6 transitions, 26 flow [2022-12-06 04:57:52,359 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:57:52,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:57:52,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 6 transitions, 26 flow [2022-12-06 04:57:52,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 6 transitions, 26 flow [2022-12-06 04:57:52,361 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:57:52,361 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:57:52,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 7 events. 0/7 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:57:52,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 6 transitions, 26 flow [2022-12-06 04:57:52,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:57:52,452 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:57:52,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 04:57:52,454 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 4 transitions, 20 flow [2022-12-06 04:57:52,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 04:57:52,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:57:52,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:57:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:57:52,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:57:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:57:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 6883285, now seen corresponding path program 1 times [2022-12-06 04:57:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:57:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296991043] [2022-12-06 04:57:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:57:52,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:57:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:57:52,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:57:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:57:52,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:57:52,506 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:57:52,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-06 04:57:52,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-06 04:57:52,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:57:52,508 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-06 04:57:52,511 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:57:52,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:57:52,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:57:52 BasicIcfg [2022-12-06 04:57:52,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:57:52,529 INFO L158 Benchmark]: Toolchain (without parser) took 3915.10ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 147.0MB in the beginning and 187.0MB in the end (delta: -40.0MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-12-06 04:57:52,532 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:57:52,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.77ms. Allocated memory is still 172.0MB. Free memory was 147.0MB in the beginning and 127.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 04:57:52,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.27ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:57:52,536 INFO L158 Benchmark]: Boogie Preprocessor took 14.28ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 124.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:57:52,536 INFO L158 Benchmark]: RCFGBuilder took 304.01ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 111.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 04:57:52,537 INFO L158 Benchmark]: TraceAbstraction took 3180.28ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 111.1MB in the beginning and 187.0MB in the end (delta: -75.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:57:52,538 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 172.0MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.77ms. Allocated memory is still 172.0MB. Free memory was 147.0MB in the beginning and 127.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.27ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.28ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 124.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.01ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 111.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3180.28ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 111.1MB in the beginning and 187.0MB in the end (delta: -75.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 56 PlacesBefore, 14 PlacesAfterwards, 52 TransitionsBefore, 10 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 18 ConcurrentYvCompositions, 0 ChoiceCompositions, 45 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 178, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 178, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 178, unknown conditional: 0, unknown unconditional: 178] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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, 14 PlacesBefore, 13 PlacesAfterwards, 8 TransitionsBefore, 7 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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.1s, 13 PlacesBefore, 11 PlacesAfterwards, 6 TransitionsBefore, 4 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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: [L681] 0 int glob1 = 0; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L696] 0 pthread_t id; [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L687] 1 glob1 = 5 [L699] CALL 0 __VERIFIER_assert(glob1 == 0) [L19] COND TRUE 0 !(cond) [L19] 0 reach_error() VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] - UnprovableResult [Line: 697]: 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 3 procedures, 81 locations, 2 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.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, 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, 20 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, InterpolantAutomatonStates: 7, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 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 04:57:52,566 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...