./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.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/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --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 01:21:23,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 01:21:23,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 01:21:23,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 01:21:23,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 01:21:23,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 01:21:23,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 01:21:23,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 01:21:23,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 01:21:23,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 01:21:23,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 01:21:23,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 01:21:23,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 01:21:23,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 01:21:23,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 01:21:23,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 01:21:23,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 01:21:23,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 01:21:23,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 01:21:23,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 01:21:23,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 01:21:23,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 01:21:23,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 01:21:23,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 01:21:23,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 01:21:23,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 01:21:23,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 01:21:23,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 01:21:23,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 01:21:23,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 01:21:23,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:21:23,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 01:21:23,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 01:21:23,662 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 01:21:23,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 01:21:23,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 01:21:23,663 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 01:21:23,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 01:21:23,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 01:21:23,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 01:21:23,666 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 01:21:23,666 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af 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 01:21:23,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 01:21:23,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 01:21:23,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 01:21:23,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 01:21:23,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 01:21:23,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-10-19 01:21:25,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 01:21:25,705 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 01:21:25,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-10-19 01:21:25,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3bd6dcdd5/e652fbfe391d4abeaf1225f51fbb9ac2/FLAG09eb43801 [2024-10-19 01:21:26,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3bd6dcdd5/e652fbfe391d4abeaf1225f51fbb9ac2 [2024-10-19 01:21:26,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 01:21:26,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 01:21:26,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 01:21:26,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 01:21:26,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 01:21:26,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3330da7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26, skipping insertion in model container [2024-10-19 01:21:26,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 01:21:26,302 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-10-19 01:21:26,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:21:26,497 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 01:21:26,508 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-10-19 01:21:26,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:21:26,606 INFO L204 MainTranslator]: Completed translation [2024-10-19 01:21:26,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26 WrapperNode [2024-10-19 01:21:26,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 01:21:26,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 01:21:26,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 01:21:26,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 01:21:26,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,671 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-10-19 01:21:26,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 01:21:26,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 01:21:26,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 01:21:26,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 01:21:26,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 01:21:26,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 01:21:26,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 01:21:26,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 01:21:26,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (1/1) ... [2024-10-19 01:21:26,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:21:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:21:26,749 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 01:21:26,751 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 01:21:26,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 01:21:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 01:21:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-19 01:21:26,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-19 01:21:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-19 01:21:26,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-19 01:21:26,803 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-19 01:21:26,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-19 01:21:26,803 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-19 01:21:26,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-19 01:21:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 01:21:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 01:21:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 01:21:26,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 01:21:26,806 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 01:21:26,981 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 01:21:26,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 01:21:27,328 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 01:21:27,329 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 01:21:27,568 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 01:21:27,568 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 01:21:27,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:21:27 BoogieIcfgContainer [2024-10-19 01:21:27,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 01:21:27,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 01:21:27,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 01:21:27,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 01:21:27,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 01:21:26" (1/3) ... [2024-10-19 01:21:27,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f59c21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:21:27, skipping insertion in model container [2024-10-19 01:21:27,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:21:26" (2/3) ... [2024-10-19 01:21:27,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f59c21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:21:27, skipping insertion in model container [2024-10-19 01:21:27,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:21:27" (3/3) ... [2024-10-19 01:21:27,580 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2024-10-19 01:21:27,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 01:21:27,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 01:21:27,598 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 01:21:27,657 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-19 01:21:27,707 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 01:21:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 01:21:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:21:27,711 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 01:21:27,713 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 01:21:27,816 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 01:21:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:21:27,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork2 ======== [2024-10-19 01:21:27,850 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;@6ad39e2f, 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 01:21:27,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 01:21:36,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 01:21:36,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:21:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2018750840, now seen corresponding path program 1 times [2024-10-19 01:21:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:21:36,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914231980] [2024-10-19 01:21:36,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:21:36,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:21:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:21:37,504 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 01:21:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:21:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914231980] [2024-10-19 01:21:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914231980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:21:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:21:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 01:21:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490749392] [2024-10-19 01:21:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:21:37,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 01:21:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:21:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:21:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:21:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:21:37,541 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:21:37,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:21:37,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:22:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1877481847, now seen corresponding path program 1 times [2024-10-19 01:22:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:22:15,522 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 01:22:15,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:22:15,715 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 01:22:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 01:22:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-19 01:22:18,531 INFO L85 PathProgramCache]: Analyzing trace with hash 716414264, now seen corresponding path program 1 times [2024-10-19 01:22:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:18,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:18,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -115436850, now seen corresponding path program 1 times [2024-10-19 01:22:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:18,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -142270068, now seen corresponding path program 1 times [2024-10-19 01:22:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:18,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1045310164, now seen corresponding path program 1 times [2024-10-19 01:22:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:19,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1490300602, now seen corresponding path program 1 times [2024-10-19 01:22:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:19,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash -102923543, now seen corresponding path program 1 times [2024-10-19 01:22:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:43,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1893956941, now seen corresponding path program 1 times [2024-10-19 01:22:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:45,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 354757069, now seen corresponding path program 1 times [2024-10-19 01:22:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:46,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash -126237679, now seen corresponding path program 1 times [2024-10-19 01:22:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:47,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2003313643, now seen corresponding path program 1 times [2024-10-19 01:22:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:48,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1516432188, now seen corresponding path program 1 times [2024-10-19 01:22:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1752205302, now seen corresponding path program 1 times [2024-10-19 01:22:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -220543612, now seen corresponding path program 1 times [2024-10-19 01:22:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1702990578, now seen corresponding path program 1 times [2024-10-19 01:22:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash -222152324, now seen corresponding path program 1 times [2024-10-19 01:22:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:22:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:22:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:22:49,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:22:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:23:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 01:23:05,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-19 01:23:05,457 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 01:23:05,460 INFO L312 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (1/2) [2024-10-19 01:23:05,465 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 01:23:05,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 01:23:05,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:23:05,492 INFO L229 MonitoredProcess]: Starting monitored process 3 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 01:23:05,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-19 01:23:05,545 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 01:23:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:23:05,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 01:23:05,547 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;@6ad39e2f, 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 01:23:05,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 01:23:25,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:23:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:23:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1955443306, now seen corresponding path program 1 times [2024-10-19 01:23:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:23:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314505727] [2024-10-19 01:23:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:23:25,532 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 01:23:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:23:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314505727] [2024-10-19 01:23:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314505727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:23:25,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:23:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 01:23:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871552201] [2024-10-19 01:23:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:23:25,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 01:23:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:23:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:23:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:23:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:25,535 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:23:25,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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 01:23:25,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:23:32,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-19 01:23:32,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:23:32,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:23:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1130512775, now seen corresponding path program 1 times [2024-10-19 01:23:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:23:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302623641] [2024-10-19 01:23:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:23:32,595 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 01:23:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:23:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302623641] [2024-10-19 01:23:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302623641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:23:32,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:23:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-19 01:23:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521524660] [2024-10-19 01:23:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:23:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 01:23:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:23:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 01:23:32,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-19 01:23:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:32,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:23:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 01:23:32,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:23:32,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -573235806, now seen corresponding path program 1 times [2024-10-19 01:23:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:35,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:23:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:23:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20 [2024-10-19 01:23:35,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:23:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:23:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1398394823, now seen corresponding path program 1 times [2024-10-19 01:23:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:23:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979014593] [2024-10-19 01:23:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:23:36,362 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 01:23:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:23:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979014593] [2024-10-19 01:23:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979014593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:23:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:23:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-19 01:23:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963243108] [2024-10-19 01:23:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:23:36,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 01:23:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:23:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 01:23:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-19 01:23:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:36,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:23:36,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 01:23:36,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:23:36,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:23:36,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:23:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -573235799, now seen corresponding path program 1 times [2024-10-19 01:23:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:36,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -152178829, now seen corresponding path program 1 times [2024-10-19 01:23:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:36,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2133650508, now seen corresponding path program 1 times [2024-10-19 01:23:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -900110602, now seen corresponding path program 1 times [2024-10-19 01:23:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1691602296, now seen corresponding path program 1 times [2024-10-19 01:23:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1040298882, now seen corresponding path program 1 times [2024-10-19 01:23:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash -792865948, now seen corresponding path program 1 times [2024-10-19 01:23:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1287585925, now seen corresponding path program 1 times [2024-10-19 01:23:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1482484771, now seen corresponding path program 1 times [2024-10-19 01:23:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:37,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:37,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 320988384, now seen corresponding path program 1 times [2024-10-19 01:23:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:44,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:23:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:23:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1266168798, now seen corresponding path program 1 times [2024-10-19 01:23:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:23:48,465 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 01:23:48,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:23:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:23:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:23:48,511 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 01:23:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 01:23:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 01:24:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash -142268653, now seen corresponding path program 1 times [2024-10-19 01:24:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:24:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:24:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:24:01,867 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 01:24:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:24:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:24:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:24:02,022 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 01:24:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:24:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-19 01:26:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1298787289, now seen corresponding path program 1 times [2024-10-19 01:26:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:10,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:26:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -473095495, now seen corresponding path program 1 times [2024-10-19 01:26:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:25,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:26:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1781110595, now seen corresponding path program 1 times [2024-10-19 01:26:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:26,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:26:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 106443837, now seen corresponding path program 1 times [2024-10-19 01:26:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:31,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:26:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1104936249, now seen corresponding path program 1 times [2024-10-19 01:26:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:31,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:26:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:26:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:26:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:26:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 01:26:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-10-19 01:26:31,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:26:31,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:26:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1627883743, now seen corresponding path program 2 times [2024-10-19 01:26:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:26:31,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404820756] [2024-10-19 01:26:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:26:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:26:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:26:33,510 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 01:26:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:26:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404820756] [2024-10-19 01:26:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404820756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:26:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:26:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-19 01:26:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299324138] [2024-10-19 01:26:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:26:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 01:26:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:26:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 01:26:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-19 01:26:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:26:33,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:26:33,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 01:26:33,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:26:33,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:26:33,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 01:26:33,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:28:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1298786146, now seen corresponding path program 1 times [2024-10-19 01:28:40,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:28:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:28:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:28:40,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:28:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash -473094052, now seen corresponding path program 1 times [2024-10-19 01:29:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:29:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:29:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:25,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:29:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 106445285, now seen corresponding path program 1 times [2024-10-19 01:29:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:29:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:29:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:31,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:29:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1104934803, now seen corresponding path program 1 times [2024-10-19 01:29:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:29:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:29:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:31,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:29:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1072766891, now seen corresponding path program 1 times [2024-10-19 01:29:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:29:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:29:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:29:32,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:29:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:30:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:30:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:30:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 01:30:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-19 01:30:05,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46 [2024-10-19 01:30:05,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:30:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:30:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1654379875, now seen corresponding path program 3 times [2024-10-19 01:30:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:30:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782544162] [2024-10-19 01:30:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:30:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:30:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:30:05,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:30:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:30:05,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 01:30:05,612 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 01:30:05,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-10-19 01:30:05,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-10-19 01:30:05,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-19 01:30:05,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-19 01:30:05,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-10-19 01:30:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-19 01:30:05,620 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 01:30:05,621 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-19 01:30:05,744 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 01:30:05,746 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 01:30:05,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 01:30:05 BasicIcfg [2024-10-19 01:30:05,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 01:30:05,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 01:30:05,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 01:30:05,751 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 01:30:05,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:21:27" (3/4) ... [2024-10-19 01:30:05,752 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 01:30:05,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 01:30:05,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 01:30:05,840 INFO L158 Benchmark]: Toolchain (without parser) took 519799.79ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 124.7MB in the beginning and 906.8MB in the end (delta: -782.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-19 01:30:05,840 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 143.6MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 01:30:05,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.93ms. Allocated memory is still 176.2MB. Free memory was 124.7MB in the beginning and 98.8MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-19 01:30:05,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.23ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 96.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:30:05,841 INFO L158 Benchmark]: Boogie Preprocessor took 31.22ms. Allocated memory is still 176.2MB. Free memory was 96.1MB in the beginning and 94.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:30:05,841 INFO L158 Benchmark]: RCFGBuilder took 864.47ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 133.5MB in the end (delta: -39.5MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-10-19 01:30:05,841 INFO L158 Benchmark]: TraceAbstraction took 518178.72ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 131.4MB in the beginning and 925.6MB in the end (delta: -794.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-19 01:30:05,842 INFO L158 Benchmark]: Witness Printer took 88.70ms. Allocated memory is still 2.1GB. Free memory was 925.6MB in the beginning and 906.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-19 01:30:05,843 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.19ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 143.6MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.93ms. Allocated memory is still 176.2MB. Free memory was 124.7MB in the beginning and 98.8MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.23ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 96.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.22ms. Allocated memory is still 176.2MB. Free memory was 96.1MB in the beginning and 94.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 864.47ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 133.5MB in the end (delta: -39.5MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * TraceAbstraction took 518178.72ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 131.4MB in the beginning and 925.6MB in the end (delta: -794.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 88.70ms. Allocated memory is still 2.1GB. Free memory was 925.6MB in the beginning and 906.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 1104, dependent conditional: 1030, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 203, independent unconditional: 1038, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1295, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82628, independent: 40639, independent conditional: 40400, independent unconditional: 240, dependent: 41989, dependent conditional: 6104, dependent unconditional: 35885, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14403, independent: 12058, independent conditional: 2542, independent unconditional: 9516, dependent: 1050, dependent conditional: 27, dependent unconditional: 1023, unknown: 1295, unknown conditional: 220, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1241, Positive conditional cache size: 203, Positive unconditional cache size: 1038, Negative cache size: 54, Negative conditional cache size: 17, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10473, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 1104, dependent conditional: 1030, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 203, independent unconditional: 1038, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1295, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82628, independent: 40639, independent conditional: 40400, independent unconditional: 240, dependent: 41989, dependent conditional: 6104, dependent unconditional: 35885, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14403, independent: 12058, independent conditional: 2542, independent unconditional: 9516, dependent: 1050, dependent conditional: 27, dependent unconditional: 1023, unknown: 1295, unknown conditional: 220, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1241, Positive conditional cache size: 203, Positive unconditional cache size: 1038, Negative cache size: 54, Negative conditional cache size: 17, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10473 ], Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 36.3s, Number of persistent set computation: 1166, Number of trivial persistent sets: 576, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1075, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13573, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 274, dependent conditional: 237, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 1104, dependent conditional: 1030, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 203, independent unconditional: 1038, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1295, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82628, independent: 40639, independent conditional: 40400, independent unconditional: 240, dependent: 41989, dependent conditional: 6104, dependent unconditional: 35885, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14403, independent: 12058, independent conditional: 2542, independent unconditional: 9516, dependent: 1050, dependent conditional: 27, dependent unconditional: 1023, unknown: 1295, unknown conditional: 220, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1241, Positive conditional cache size: 203, Positive unconditional cache size: 1038, Negative cache size: 54, Negative conditional cache size: 17, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10473, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 12232, independent unconditional: 1067, dependent: 1104, dependent conditional: 1030, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14403, independent: 13299, independent conditional: 2745, independent unconditional: 10554, dependent: 1104, dependent conditional: 44, dependent unconditional: 1060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 203, independent unconditional: 1038, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1295, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 245, independent: 191, independent conditional: 179, independent unconditional: 12, dependent: 54, dependent conditional: 17, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82628, independent: 40639, independent conditional: 40400, independent unconditional: 240, dependent: 41989, dependent conditional: 6104, dependent unconditional: 35885, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14403, independent: 12058, independent conditional: 2542, independent unconditional: 9516, dependent: 1050, dependent conditional: 27, dependent unconditional: 1023, unknown: 1295, unknown conditional: 220, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1241, Positive conditional cache size: 203, Positive unconditional cache size: 1038, Negative cache size: 54, Negative conditional cache size: 17, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10473 ], Independence queries for same thread: 0 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 79505, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1039, dependent conditional: 995, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 10303, dependent conditional: 10215, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2878, independent: 2772, independent conditional: 1621, independent unconditional: 1151, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2878, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 1687, dependent conditional: 0, dependent unconditional: 1687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401519, independent: 352768, independent conditional: 352658, independent unconditional: 110, dependent: 48751, dependent conditional: 9072, dependent unconditional: 39679, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88769, independent: 75694, independent conditional: 24393, independent unconditional: 51301, dependent: 10197, dependent conditional: 206, dependent unconditional: 9991, unknown: 2878, unknown conditional: 1681, unknown unconditional: 1197] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2772, Positive conditional cache size: 1621, Positive unconditional cache size: 1151, Negative cache size: 106, Negative conditional cache size: 60, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61140, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 10303, dependent conditional: 10215, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2878, independent: 2772, independent conditional: 1621, independent unconditional: 1151, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2878, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 1687, dependent conditional: 0, dependent unconditional: 1687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401519, independent: 352768, independent conditional: 352658, independent unconditional: 110, dependent: 48751, dependent conditional: 9072, dependent unconditional: 39679, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88769, independent: 75694, independent conditional: 24393, independent unconditional: 51301, dependent: 10197, dependent conditional: 206, dependent unconditional: 9991, unknown: 2878, unknown conditional: 1681, unknown unconditional: 1197] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2772, Positive conditional cache size: 1621, Positive unconditional cache size: 1151, Negative cache size: 106, Negative conditional cache size: 60, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61140 ], Independence queries for same thread: 17, Persistent sets #1 benchmarks: Persistent set computation time: 36.5s, Number of persistent set computation: 3466, Number of trivial persistent sets: 1850, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1195, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 79505, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1039, dependent conditional: 995, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79488, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 1022, dependent conditional: 978, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 10303, dependent conditional: 10215, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2878, independent: 2772, independent conditional: 1621, independent unconditional: 1151, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2878, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 1687, dependent conditional: 0, dependent unconditional: 1687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401519, independent: 352768, independent conditional: 352658, independent unconditional: 110, dependent: 48751, dependent conditional: 9072, dependent unconditional: 39679, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88769, independent: 75694, independent conditional: 24393, independent unconditional: 51301, dependent: 10197, dependent conditional: 206, dependent unconditional: 9991, unknown: 2878, unknown conditional: 1681, unknown unconditional: 1197] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2772, Positive conditional cache size: 1621, Positive unconditional cache size: 1151, Negative cache size: 106, Negative conditional cache size: 60, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61140, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 77205, independent unconditional: 1261, dependent: 10303, dependent conditional: 10215, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88769, independent: 78466, independent conditional: 26014, independent unconditional: 52452, dependent: 10303, dependent conditional: 266, dependent unconditional: 10037, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2878, independent: 2772, independent conditional: 1621, independent unconditional: 1151, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2878, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 1687, dependent conditional: 0, dependent unconditional: 1687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1581, independent conditional: 1566, independent unconditional: 15, dependent: 106, dependent conditional: 60, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401519, independent: 352768, independent conditional: 352658, independent unconditional: 110, dependent: 48751, dependent conditional: 9072, dependent unconditional: 39679, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88769, independent: 75694, independent conditional: 24393, independent unconditional: 51301, dependent: 10197, dependent conditional: 206, dependent unconditional: 9991, unknown: 2878, unknown conditional: 1681, unknown unconditional: 1197] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2772, Positive conditional cache size: 1621, Positive unconditional cache size: 1151, Negative cache size: 106, Negative conditional cache size: 60, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61140 ], Independence queries for same thread: 17 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L833] 4 return 0; [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 851]: 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: 847]: 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: 849]: 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: 853]: 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: P2Thread1of1ForFork2 with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 97.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 96.7s, 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: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: 52.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 16, ConditionalCommutativityTraceChecks: 16, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 420.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 416.8s, 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: 31, 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.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 347.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 28, ConditionalCommutativityTraceChecks: 23, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-19 01:30:05,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-10-19 01:30:06,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 01:30:06,275 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