./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 03:09:42,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 03:09:42,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 03:09:42,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 03:09:42,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 03:09:42,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 03:09:42,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 03:09:42,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 03:09:42,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 03:09:42,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 03:09:42,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 03:09:42,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 03:09:42,137 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 03:09:42,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 03:09:42,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 03:09:42,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 03:09:42,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 03:09:42,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 03:09:42,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 03:09:42,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 03:09:42,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 03:09:42,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 03:09:42,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 03:09:42,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 03:09:42,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 03:09:42,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:09:42,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 03:09:42,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 03:09:42,146 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 03:09:42,148 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 03:09:42,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 03:09:42,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 03:09:42,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 03:09:42,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 03:09:42,377 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 03:09:42,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-10-19 03:09:43,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 03:09:43,841 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 03:09:43,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-10-19 03:09:43,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/15da9b4c5/39513148936645d2876aa710c19c9ce2/FLAG856152d2f [2024-10-19 03:09:43,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/15da9b4c5/39513148936645d2876aa710c19c9ce2 [2024-10-19 03:09:43,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 03:09:43,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 03:09:43,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 03:09:43,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 03:09:43,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 03:09:43,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:09:43" (1/1) ... [2024-10-19 03:09:43,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b1959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:43, skipping insertion in model container [2024-10-19 03:09:43,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:09:43" (1/1) ... [2024-10-19 03:09:43,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 03:09:44,288 WARN L247 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[186294,186307] [2024-10-19 03:09:44,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:09:44,327 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 03:09:44,368 WARN L247 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[186294,186307] [2024-10-19 03:09:44,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:09:44,424 INFO L204 MainTranslator]: Completed translation [2024-10-19 03:09:44,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44 WrapperNode [2024-10-19 03:09:44,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 03:09:44,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 03:09:44,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 03:09:44,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 03:09:44,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,477 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-10-19 03:09:44,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 03:09:44,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 03:09:44,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 03:09:44,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 03:09:44,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 03:09:44,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 03:09:44,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 03:09:44,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 03:09:44,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (1/1) ... [2024-10-19 03:09:44,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:09:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:09:44,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 03:09:44,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 03:09:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-19 03:09:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-19 03:09:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 03:09:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 03:09:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 03:09:44,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 03:09:44,605 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 03:09:44,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 03:09:44,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 03:09:44,967 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 03:09:44,967 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 03:09:45,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 03:09:45,071 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 03:09:45,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:09:45 BoogieIcfgContainer [2024-10-19 03:09:45,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 03:09:45,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 03:09:45,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 03:09:45,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 03:09:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 03:09:43" (1/3) ... [2024-10-19 03:09:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e4de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:09:45, skipping insertion in model container [2024-10-19 03:09:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:09:44" (2/3) ... [2024-10-19 03:09:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e4de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:09:45, skipping insertion in model container [2024-10-19 03:09:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:09:45" (3/3) ... [2024-10-19 03:09:45,110 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-10-19 03:09:45,133 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 03:09:45,133 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-19 03:09:45,134 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 03:09:45,197 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 03:09:45,237 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:09:45,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:09:45,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:09:45,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 03:09:45,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 03:09:45,322 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:09:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:45,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 03:09:45,340 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@18d6f8a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:09:45,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-19 03:09:45,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 12997494, now seen corresponding path program 1 times [2024-10-19 03:09:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382183515] [2024-10-19 03:09:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382183515] [2024-10-19 03:09:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382183515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:45,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:45,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 03:09:45,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126693818] [2024-10-19 03:09:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:45,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 03:09:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:09:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:09:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:45,875 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-19 03:09:45,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:45,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 03:09:45,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash -394243086, now seen corresponding path program 1 times [2024-10-19 03:09:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959678146] [2024-10-19 03:09:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959678146] [2024-10-19 03:09:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959678146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:46,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 03:09:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999410190] [2024-10-19 03:09:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:46,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:09:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:09:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:09:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:46,043 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:46,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2024-10-19 03:09:46,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:46,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:46,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-19 03:09:46,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 959577463, now seen corresponding path program 1 times [2024-10-19 03:09:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618950559] [2024-10-19 03:09:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618950559] [2024-10-19 03:09:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618950559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 03:09:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091007357] [2024-10-19 03:09:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:46,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 03:09:46,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:09:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:09:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:46,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:09:46,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:46,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:46,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-19 03:09:47,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 180952419, now seen corresponding path program 1 times [2024-10-19 03:09:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502582393] [2024-10-19 03:09:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502582393] [2024-10-19 03:09:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502582393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-19 03:09:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424591789] [2024-10-19 03:09:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-19 03:09:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 03:09:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-19 03:09:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:48,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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) [2024-10-19 03:09:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-19 03:09:48,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-19 03:09:48,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2096647850, now seen corresponding path program 1 times [2024-10-19 03:09:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741833231] [2024-10-19 03:09:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741833231] [2024-10-19 03:09:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741833231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:50,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-19 03:09:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750030743] [2024-10-19 03:09:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:50,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 03:09:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 03:09:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-19 03:09:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:50,089 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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) [2024-10-19 03:09:50,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:50,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:50,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:50,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-19 03:09:50,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:51,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11898 treesize of output 11450 [2024-10-19 03:09:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 947601373, now seen corresponding path program 1 times [2024-10-19 03:09:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:09:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:09:53,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1446 treesize of output 1350 [2024-10-19 03:09:53,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-19 03:09:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-19 03:09:53,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-19 03:09:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1385827298, now seen corresponding path program 1 times [2024-10-19 03:09:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 03:09:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-19 03:09:54,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-10-19 03:09:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 376127010, now seen corresponding path program 1 times [2024-10-19 03:09:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:54,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:09:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 03:09:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-19 03:09:55,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable9 [2024-10-19 03:09:55,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:55,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 33742977, now seen corresponding path program 2 times [2024-10-19 03:09:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948688839] [2024-10-19 03:09:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:09:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 03:09:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:09:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948688839] [2024-10-19 03:09:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948688839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:09:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:09:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-19 03:09:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481850416] [2024-10-19 03:09:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:09:55,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 03:09:55,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:09:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 03:09:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-19 03:09:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:55,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:09:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-10-19 03:09:55,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:55,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:55,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:55,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 03:09:55,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-19 03:09:55,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:09:56,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-10-19 03:09:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 376127051, now seen corresponding path program 1 times [2024-10-19 03:09:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:56,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:09:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-19 03:09:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-19 03:09:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-19 03:09:56,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-19 03:09:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:09:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1932672440, now seen corresponding path program 2 times [2024-10-19 03:09:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:09:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697453142] [2024-10-19 03:09:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:09:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:09:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:56,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:09:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:09:56,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 03:09:56,998 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 03:09:56,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-10-19 03:09:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-10-19 03:09:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-10-19 03:09:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-10-19 03:09:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-10-19 03:09:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-10-19 03:09:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-19 03:09:57,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-10-19 03:09:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-19 03:09:57,010 INFO L414 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 03:09:57,069 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 03:09:57,073 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 03:09:57,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 03:09:57 BasicIcfg [2024-10-19 03:09:57,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 03:09:57,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 03:09:57,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 03:09:57,076 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 03:09:57,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:09:45" (3/4) ... [2024-10-19 03:09:57,077 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 03:09:57,141 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 03:09:57,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 03:09:57,141 INFO L158 Benchmark]: Toolchain (without parser) took 13263.44ms. Allocated memory was 138.4MB in the beginning and 457.2MB in the end (delta: 318.8MB). Free memory was 63.9MB in the beginning and 404.9MB in the end (delta: -341.0MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,141 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.88ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 63.7MB in the beginning and 132.8MB in the end (delta: -69.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.79ms. Allocated memory is still 188.7MB. Free memory was 132.8MB in the beginning and 129.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 188.7MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: RCFGBuilder took 543.50ms. Allocated memory is still 188.7MB. Free memory was 127.4MB in the beginning and 88.4MB in the end (delta: 39.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: TraceAbstraction took 11978.07ms. Allocated memory was 188.7MB in the beginning and 457.2MB in the end (delta: 268.4MB). Free memory was 152.7MB in the beginning and 150.2MB in the end (delta: 2.5MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,142 INFO L158 Benchmark]: Witness Printer took 65.29ms. Allocated memory is still 457.2MB. Free memory was 150.2MB in the beginning and 404.9MB in the end (delta: -254.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 03:09:57,143 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.88ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 63.7MB in the beginning and 132.8MB in the end (delta: -69.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.79ms. Allocated memory is still 188.7MB. Free memory was 132.8MB in the beginning and 129.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 188.7MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.50ms. Allocated memory is still 188.7MB. Free memory was 127.4MB in the beginning and 88.4MB in the end (delta: 39.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11978.07ms. Allocated memory was 188.7MB in the beginning and 457.2MB in the end (delta: 268.4MB). Free memory was 152.7MB in the beginning and 150.2MB in the end (delta: 2.5MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. * Witness Printer took 65.29ms. Allocated memory is still 457.2MB. Free memory was 150.2MB in the beginning and 404.9MB in the end (delta: -254.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 919, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 136, dependent conditional: 111, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 106, dependent conditional: 56, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 384, independent: 339, independent conditional: 32, independent unconditional: 307, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 384, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4308, independent: 1268, independent conditional: 845, independent unconditional: 423, dependent: 3040, dependent conditional: 1132, dependent unconditional: 1908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 444, independent conditional: 167, independent unconditional: 277, dependent: 61, dependent conditional: 14, dependent unconditional: 47, unknown: 384, unknown conditional: 52, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 339, Positive conditional cache size: 32, Positive unconditional cache size: 307, Negative cache size: 45, Negative conditional cache size: 20, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 291, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 106, dependent conditional: 56, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 384, independent: 339, independent conditional: 32, independent unconditional: 307, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 384, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4308, independent: 1268, independent conditional: 845, independent unconditional: 423, dependent: 3040, dependent conditional: 1132, dependent unconditional: 1908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 444, independent conditional: 167, independent unconditional: 277, dependent: 61, dependent conditional: 14, dependent unconditional: 47, unknown: 384, unknown conditional: 52, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 339, Positive conditional cache size: 32, Positive unconditional cache size: 307, Negative cache size: 45, Negative conditional cache size: 20, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 291 ], Independence queries for same thread: 101, Persistent sets #1 benchmarks: Persistent set computation time: 2.4s, Number of persistent set computation: 108, Number of trivial persistent sets: 95, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332, independent: 307, independent conditional: 0, independent unconditional: 307, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 919, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 136, dependent conditional: 111, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 106, dependent conditional: 56, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 384, independent: 339, independent conditional: 32, independent unconditional: 307, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 384, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4308, independent: 1268, independent conditional: 845, independent unconditional: 423, dependent: 3040, dependent conditional: 1132, dependent unconditional: 1908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 444, independent conditional: 167, independent unconditional: 277, dependent: 61, dependent conditional: 14, dependent unconditional: 47, unknown: 384, unknown conditional: 52, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 339, Positive conditional cache size: 32, Positive unconditional cache size: 307, Negative cache size: 45, Negative conditional cache size: 20, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 291, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 468, independent unconditional: 315, dependent: 106, dependent conditional: 56, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 783, independent conditional: 199, independent unconditional: 584, dependent: 106, dependent conditional: 34, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 384, independent: 339, independent conditional: 32, independent unconditional: 307, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 384, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 22, independent conditional: 17, independent unconditional: 5, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4308, independent: 1268, independent conditional: 845, independent unconditional: 423, dependent: 3040, dependent conditional: 1132, dependent unconditional: 1908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 444, independent conditional: 167, independent unconditional: 277, dependent: 61, dependent conditional: 14, dependent unconditional: 47, unknown: 384, unknown conditional: 52, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 339, Positive conditional cache size: 32, Positive unconditional cache size: 307, Negative cache size: 45, Negative conditional cache size: 20, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 291 ], Independence queries for same thread: 101 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=0] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1=-2, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 1 return 0; [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 2 return 0; [L3935] 0 return 0; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result=0, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, data={5:0}, expression=1, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3887] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3933]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3934]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 60 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 8.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: 60, 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.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 1498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 3.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 4, ConditionalCommutativityTraceChecks: 4, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-19 03:09:57,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-19 03:09:57,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE