/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 13:12:26,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 13:12:26,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 13:12:27,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 13:12:27,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 13:12:27,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 13:12:27,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 13:12:27,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 13:12:27,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 13:12:27,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 13:12:27,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 13:12:27,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 13:12:27,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 13:12:27,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 13:12:27,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 13:12:27,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 13:12:27,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 13:12:27,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 13:12:27,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 13:12:27,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 13:12:27,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 13:12:27,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 13:12:27,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 13:12:27,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 13:12:27,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 13:12:27,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 13:12:27,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 13:12:27,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 13:12:27,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 13:12:27,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 13:12:27,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 13:12:27,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 13:12:27,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 13:12:27,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 13:12:27,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 13:12:27,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 13:12:27,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 13:12:27,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 13:12:27,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 13:12:27,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 13:12:27,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 13:12:27,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 13:12:27,079 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 13:12:27,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 13:12:27,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 13:12:27,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 13:12:27,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 13:12:27,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 13:12:27,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 13:12:27,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 13:12:27,081 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 13:12:27,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 13:12:27,081 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 13:12:27,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 13:12:27,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 13:12:27,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 13:12:27,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 13:12:27,084 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 13:12:27,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-20 13:12:27,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 13:12:27,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 13:12:27,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 13:12:27,272 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 13:12:27,273 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 13:12:27,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-05-20 13:12:27,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa57c4b1/699cdb5a288843079d2a467cfb596980/FLAGb67181575 [2023-05-20 13:12:27,815 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 13:12:27,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-05-20 13:12:27,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa57c4b1/699cdb5a288843079d2a467cfb596980/FLAGb67181575 [2023-05-20 13:12:28,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa57c4b1/699cdb5a288843079d2a467cfb596980 [2023-05-20 13:12:28,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 13:12:28,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 13:12:28,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 13:12:28,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 13:12:28,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 13:12:28,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649e04bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28, skipping insertion in model container [2023-05-20 13:12:28,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 13:12:28,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 13:12:28,292 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-20 13:12:28,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-05-20 13:12:28,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 13:12:28,585 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 13:12:28,592 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-20 13:12:28,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-05-20 13:12:28,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 13:12:28,682 INFO L208 MainTranslator]: Completed translation [2023-05-20 13:12:28,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28 WrapperNode [2023-05-20 13:12:28,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 13:12:28,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 13:12:28,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 13:12:28,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 13:12:28,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,734 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2023-05-20 13:12:28,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 13:12:28,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 13:12:28,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 13:12:28,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 13:12:28,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,760 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 13:12:28,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 13:12:28,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 13:12:28,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 13:12:28,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (1/1) ... [2023-05-20 13:12:28,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 13:12:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 13:12:28,791 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) [2023-05-20 13:12:28,805 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 [2023-05-20 13:12:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 13:12:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-05-20 13:12:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 13:12:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 13:12:28,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 13:12:29,027 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 13:12:29,029 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 13:12:29,197 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 13:12:29,210 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 13:12:29,210 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-20 13:12:29,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 01:12:29 BoogieIcfgContainer [2023-05-20 13:12:29,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 13:12:29,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 13:12:29,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 13:12:29,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 13:12:29,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 01:12:28" (1/3) ... [2023-05-20 13:12:29,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6c08c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 01:12:29, skipping insertion in model container [2023-05-20 13:12:29,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:12:28" (2/3) ... [2023-05-20 13:12:29,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6c08c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 01:12:29, skipping insertion in model container [2023-05-20 13:12:29,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 01:12:29" (3/3) ... [2023-05-20 13:12:29,218 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-05-20 13:12:29,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 13:12:29,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 13:12:29,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-05-20 13:12:29,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 13:12:29,309 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 13:12:29,346 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 13:12:29,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 13:12:29,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 13:12:29,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 13:12:29,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 13:12:29,412 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 13:12:29,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 13:12:29,440 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@27a5ee96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 13:12:29,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-05-20 13:12:41,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-20 13:12:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 13:12:41,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1300041936, now seen corresponding path program 1 times [2023-05-20 13:12:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 13:12:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702056825] [2023-05-20 13:12:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 13:12:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 13:12:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 13:12:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 13:12:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 13:12:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702056825] [2023-05-20 13:12:42,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702056825] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 13:12:42,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 13:12:42,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-20 13:12:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226056487] [2023-05-20 13:12:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 13:12:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-20 13:12:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 13:12:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-20 13:12:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-20 13:12:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:42,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 13:12:42,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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) [2023-05-20 13:12:42,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:42,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 13:12:42,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-20 13:12:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 13:12:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1592238007, now seen corresponding path program 1 times [2023-05-20 13:12:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 13:12:42,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760138934] [2023-05-20 13:12:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 13:12:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 13:12:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 13:12:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 13:12:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 13:12:43,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760138934] [2023-05-20 13:12:43,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760138934] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 13:12:43,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 13:12:43,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-20 13:12:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058417127] [2023-05-20 13:12:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 13:12:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-20 13:12:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 13:12:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-20 13:12:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-20 13:12:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:43,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 13:12:43,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2023-05-20 13:12:43,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:43,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 13:12:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 13:12:43,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-20 13:12:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 13:12:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -939196125, now seen corresponding path program 1 times [2023-05-20 13:12:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 13:12:43,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503346923] [2023-05-20 13:12:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 13:12:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 13:12:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 13:12:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 13:12:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 13:12:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503346923] [2023-05-20 13:12:46,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503346923] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 13:12:46,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 13:12:46,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-05-20 13:12:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590530644] [2023-05-20 13:12:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 13:12:46,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-20 13:12:46,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 13:12:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-20 13:12:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2023-05-20 13:12:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:46,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 13:12:46,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.961538461538462) internal successors, (129), 26 states have internal predecessors, (129), 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) [2023-05-20 13:12:46,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:46,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 13:12:46,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 13:12:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-20 13:12:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 13:12:49,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-20 13:12:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 13:12:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -513085539, now seen corresponding path program 1 times [2023-05-20 13:12:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 13:12:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684497475] [2023-05-20 13:12:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 13:12:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 13:12:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 13:12:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 13:12:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 13:12:50,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684497475] [2023-05-20 13:12:50,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684497475] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 13:12:50,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 13:12:50,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-05-20 13:12:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052724281] [2023-05-20 13:12:50,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 13:12:50,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 13:12:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 13:12:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 13:12:50,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-05-20 13:12:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:50,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 13:12:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 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) [2023-05-20 13:12:50,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:50,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 13:12:50,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-20 13:12:50,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 13:12:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 13:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 13:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 13:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-20 13:12:57,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-20 13:12:57,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-20 13:12:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 13:12:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -642887755, now seen corresponding path program 2 times [2023-05-20 13:12:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 13:12:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121382963] [2023-05-20 13:12:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 13:12:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 13:12:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 13:12:57,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 13:12:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 13:12:57,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 13:12:57,197 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 13:12:57,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-05-20 13:12:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-05-20 13:12:57,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-05-20 13:12:57,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 13:12:57,206 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-05-20 13:12:57,210 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 13:12:57,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 13:12:57,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 01:12:57 BasicIcfg [2023-05-20 13:12:57,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 13:12:57,299 INFO L158 Benchmark]: Toolchain (without parser) took 29211.72ms. Allocated memory was 217.1MB in the beginning and 287.3MB in the end (delta: 70.3MB). Free memory was 186.4MB in the beginning and 240.1MB in the end (delta: -53.7MB). Peak memory consumption was 179.3MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,299 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 13:12:57,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.31ms. Allocated memory is still 217.1MB. Free memory was 186.1MB in the beginning and 142.6MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 217.1MB. Free memory was 142.6MB in the beginning and 139.0MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,300 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 217.1MB. Free memory was 139.0MB in the beginning and 136.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,309 INFO L158 Benchmark]: RCFGBuilder took 447.00ms. Allocated memory is still 217.1MB. Free memory was 136.4MB in the beginning and 175.0MB in the end (delta: -38.6MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,311 INFO L158 Benchmark]: TraceAbstraction took 28085.09ms. Allocated memory was 217.1MB in the beginning and 287.3MB in the end (delta: 70.3MB). Free memory was 173.4MB in the beginning and 240.1MB in the end (delta: -66.7MB). Peak memory consumption was 166.1MB. Max. memory is 8.0GB. [2023-05-20 13:12:57,313 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.10ms. Allocated memory is still 164.6MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 580.31ms. Allocated memory is still 217.1MB. Free memory was 186.1MB in the beginning and 142.6MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 217.1MB. Free memory was 142.6MB in the beginning and 139.0MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 217.1MB. Free memory was 139.0MB in the beginning and 136.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 447.00ms. Allocated memory is still 217.1MB. Free memory was 136.4MB in the beginning and 175.0MB in the end (delta: -38.6MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28085.09ms. Allocated memory was 217.1MB in the beginning and 287.3MB in the end (delta: 70.3MB). Free memory was 173.4MB in the beginning and 240.1MB in the end (delta: -66.7MB). Peak memory consumption was 166.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1557, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 241, dependent conditional: 223, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1339, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1339, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 11, dependent unconditional: 25, unknown: 41, unknown conditional: 17, unknown unconditional: 24] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 41, unknown conditional: 5, unknown unconditional: 36] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 41, unknown conditional: 5, unknown unconditional: 36] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 961, independent: 923, independent conditional: 4, independent unconditional: 919, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 961, independent: 918, independent conditional: 0, independent unconditional: 918, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18609, independent: 71, independent conditional: 34, independent unconditional: 37, dependent: 307, dependent conditional: 91, dependent unconditional: 216, unknown: 18230, unknown conditional: 4254, unknown unconditional: 13976] , Protected Queries: 0 ], Cache Queries: [ total: 1371, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 985, unknown conditional: 12, unknown unconditional: 973] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 923, Positive conditional cache size: 4, Positive unconditional cache size: 919, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 17, Unknown conditional cache size: 4, Unknown unconditional cache size: 13, Eliminated conditions: 19, Maximal queried relation: 4, Independence queries for same thread: 218 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 14.3s, Number of persistent set computation: 178, Number of trivial persistent sets: 165, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 950, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1557, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 241, dependent conditional: 223, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1339, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1339, independent: 1294, independent conditional: 375, independent unconditional: 919, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 11, dependent unconditional: 25, unknown: 41, unknown conditional: 17, unknown unconditional: 24] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 41, unknown conditional: 5, unknown unconditional: 36] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1371, independent: 1294, independent conditional: 4, independent unconditional: 1290, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 41, unknown conditional: 5, unknown unconditional: 36] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 961, independent: 923, independent conditional: 4, independent unconditional: 919, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 961, independent: 918, independent conditional: 0, independent unconditional: 918, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18609, independent: 71, independent conditional: 34, independent unconditional: 37, dependent: 307, dependent conditional: 91, dependent unconditional: 216, unknown: 18230, unknown conditional: 4254, unknown unconditional: 13976] , Protected Queries: 0 ], Cache Queries: [ total: 1371, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 985, unknown conditional: 12, unknown unconditional: 973] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 923, Positive conditional cache size: 4, Positive unconditional cache size: 919, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 17, Unknown conditional cache size: 4, Unknown unconditional cache size: 13, Eliminated conditions: 19, Maximal queried relation: 4, Independence queries for same thread: 218 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}] [L1676] 0 pthread_t t1,t2; VAL [my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; VAL [\result=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1736] 0 struct my_data data; VAL [data={8:0}, my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 VAL [data={8:0}, data={8:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.b = 0 VAL [data={8:0}, data={8:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] EXPR 0 data->shared.a VAL [data={8:0}, data={8:0}, data->shared.a=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b VAL [data={8:0}, data={8:0}, data->shared.b=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, data={8:0}, data={8:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [data={8:0}, data={8:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1712] 0 my_dev = &data->dev VAL [data={8:0}, data={8:0}, my_dev={8:24}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={8:0}, data={8:0}, my_dev={8:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=6, res=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, my_dev={8:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=7, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, my_dev={8:24}, res=0, t1={3:0}, t2={4:0}] [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, my_dev={8:24}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, my_dev={8:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, my_dev={8:24}, status={10:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [\read(t1)=6, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, my_dev={8:24}, status={10:0}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=6, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, lb=0, my_dev={8:24}, pthread_join(t1, &status)={0:0}, status={10:0}, t1={3:0}, t2={4:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\read(t2)=7, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, lb=0, my_dev={8:24}, status={10:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=7, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data={8:0}, lb=0, my_dev={8:24}, pthread_join(t2, &status)={0:0}, status={10:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a VAL [\result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data.shared.a=1, lb=0, my_dev={8:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, expression=1, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b VAL [\result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, data={8:0}, data.shared.b=1, lb=0, my_dev={8:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, expression=0, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={8:24}, arg={0:0}, arg={0:0}, data={8:0}, expression=0, lb=0, my_dev={8:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1714]: 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: 1713]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 22.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 5157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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! [2023-05-20 13:12:57,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-20 13:12:57,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...