./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/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 /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a0803bc25bdee4cec741e6286f7294c3704d91bb65e5684830693d517eafafb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 17:18:28,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 17:18:28,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 17:18:28,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 17:18:28,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 17:18:28,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 17:18:28,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 17:18:28,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 17:18:28,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 17:18:28,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 17:18:28,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 17:18:28,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 17:18:28,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 17:18:28,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 17:18:28,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 17:18:28,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 17:18:28,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 17:18:28,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 17:18:28,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 17:18:28,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 17:18:28,643 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 17:18:28,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 17:18:28,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 17:18:28,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 17:18:28,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 17:18:28,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 17:18:28,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 17:18:28,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 17:18:28,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 17:18:28,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 17:18:28,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 17:18:28,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 17:18:28,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 17:18:28,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 17:18:28,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 17:18:28,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 17:18:28,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 17:18:28,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 17:18:28,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 17:18:28,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 17:18:28,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 17:18:28,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 17:18:28,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-04-18 17:18:28,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 17:18:28,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 17:18:28,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 17:18:28,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 17:18:28,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 17:18:28,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 17:18:28,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 17:18:28,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 17:18:28,685 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 17:18:28,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 17:18:28,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 17:18:28,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 17:18:28,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 17:18:28,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-18 17:18:28,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 17:18:28,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:18:28,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 17:18:28,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 17:18:28,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-04-18 17:18:28,689 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-04-18 17:18:28,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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.graphml 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 ! data-race) ) 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 -> 7a0803bc25bdee4cec741e6286f7294c3704d91bb65e5684830693d517eafafb [2022-04-18 17:18:28,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 17:18:28,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 17:18:28,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 17:18:28,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 17:18:28,890 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 17:18:28,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i [2022-04-18 17:18:28,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb6131e1/2f7ee834148e4f84a7b15167207b10c5/FLAG804edc90c [2022-04-18 17:18:29,361 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 17:18:29,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i [2022-04-18 17:18:29,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb6131e1/2f7ee834148e4f84a7b15167207b10c5/FLAG804edc90c [2022-04-18 17:18:29,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb6131e1/2f7ee834148e4f84a7b15167207b10c5 [2022-04-18 17:18:29,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 17:18:29,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 17:18:29,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 17:18:29,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 17:18:29,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 17:18:29,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:18:29" (1/1) ... [2022-04-18 17:18:29,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e633ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:29, skipping insertion in model container [2022-04-18 17:18:29,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:18:29" (1/1) ... [2022-04-18 17:18:29,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 17:18:29,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 17:18:30,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i[30582,30595] [2022-04-18 17:18:30,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:18:30,063 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 17:18:30,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i[30582,30595] [2022-04-18 17:18:30,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:18:30,151 INFO L208 MainTranslator]: Completed translation [2022-04-18 17:18:30,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30 WrapperNode [2022-04-18 17:18:30,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 17:18:30,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 17:18:30,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 17:18:30,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 17:18:30,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,197 INFO L137 Inliner]: procedures = 170, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-04-18 17:18:30,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 17:18:30,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 17:18:30,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 17:18:30,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 17:18:30,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 17:18:30,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 17:18:30,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 17:18:30,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 17:18:30,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (1/1) ... [2022-04-18 17:18:30,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:18:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:30,264 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) [2022-04-18 17:18:30,282 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 [2022-04-18 17:18:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 17:18:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-04-18 17:18:30,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 17:18:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 17:18:30,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 17:18:30,302 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 17:18:30,406 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 17:18:30,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 17:18:30,655 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 17:18:30,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 17:18:30,781 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-18 17:18:30,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:18:30 BoogieIcfgContainer [2022-04-18 17:18:30,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 17:18:30,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 17:18:30,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 17:18:30,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 17:18:30,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 05:18:29" (1/3) ... [2022-04-18 17:18:30,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79e1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:18:30, skipping insertion in model container [2022-04-18 17:18:30,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:30" (2/3) ... [2022-04-18 17:18:30,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79e1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:18:30, skipping insertion in model container [2022-04-18 17:18:30,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:18:30" (3/3) ... [2022-04-18 17:18:30,790 INFO L111 eAbstractionObserver]: Analyzing ICFG 12_fmaxsymopt_cas.i [2022-04-18 17:18:30,795 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 17:18:30,796 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 17:18:30,797 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-04-18 17:18:30,797 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 17:18:30,869 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:30,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:30,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:30,913 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) [2022-04-18 17:18:30,930 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 [2022-04-18 17:18:30,954 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2022-04-18 17:18:30,959 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-18 17:18:30,960 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-04-18 17:18:31,058 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 401570700, now seen corresponding path program 1 times [2022-04-18 17:18:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680448002] [2022-04-18 17:18:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 17:18:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:31,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680448002] [2022-04-18 17:18:31,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680448002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:31,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:31,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068186226] [2022-04-18 17:18:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:31,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,281 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:31,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:31,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 17:18:31,363 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 654854817, now seen corresponding path program 1 times [2022-04-18 17:18:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815439302] [2022-04-18 17:18:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815439302] [2022-04-18 17:18:31,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815439302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:31,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:31,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:18:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74072860] [2022-04-18 17:18:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:31,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,489 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:31,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:31,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:31,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 17:18:31,529 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1694187839, now seen corresponding path program 1 times [2022-04-18 17:18:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:31,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636969048] [2022-04-18 17:18:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636969048] [2022-04-18 17:18:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636969048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:31,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509555632] [2022-04-18 17:18:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:31,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:31,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,698 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:31,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:31,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:31,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:31,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 17:18:31,770 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1412549146, now seen corresponding path program 1 times [2022-04-18 17:18:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:31,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350895437] [2022-04-18 17:18:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:31,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:31,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350895437] [2022-04-18 17:18:31,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350895437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:18:31,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81662443] [2022-04-18 17:18:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:31,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:18:31,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 17:18:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:31,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 17:18:31,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:18:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:32,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:18:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81662443] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:18:32,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:18:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-04-18 17:18:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906892558] [2022-04-18 17:18:32,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:18:32,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 17:18:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 17:18:32,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 17:18:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,228 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:32,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:32,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:32,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:32,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:32,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 17:18:32,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:32,496 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 392542209, now seen corresponding path program 2 times [2022-04-18 17:18:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:32,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486371094] [2022-04-18 17:18:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-18 17:18:32,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486371094] [2022-04-18 17:18:32,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486371094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:32,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:32,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073940301] [2022-04-18 17:18:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:32,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,648 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:32,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:32,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:32,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:32,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:32,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:32,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 17:18:33,111 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1653034, now seen corresponding path program 1 times [2022-04-18 17:18:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335878252] [2022-04-18 17:18:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-18 17:18:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:33,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335878252] [2022-04-18 17:18:33,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335878252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:33,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:33,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:33,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868857017] [2022-04-18 17:18:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:33,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:33,212 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:33,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:33,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:33,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:33,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:33,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:33,522 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:33,532 WARN L322 ript$VariableManager]: TermVariabe |v_#race_275| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:33,700 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:33,723 WARN L322 ript$VariableManager]: TermVariabe |v_#race_275| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:33,867 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:35,147 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:36,469 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:37,959 WARN L322 ript$VariableManager]: TermVariabe |v_#race_275| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:40,124 WARN L322 ript$VariableManager]: TermVariabe |v_#race_275| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:41,845 WARN L322 ript$VariableManager]: TermVariabe |v_#race_273| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:43,246 WARN L322 ript$VariableManager]: TermVariabe |v_#race_275| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:45,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-04-18 17:18:45,155 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-04-18 17:18:45,156 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-04-18 17:18:45,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 17:18:45,162 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-18 17:18:45,162 INFO L306 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2022-04-18 17:18:45,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:45,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:45,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:45,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-04-18 17:18:45,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-04-18 17:18:45,178 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-18 17:18:45,178 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-18 17:18:45,239 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1211463154, now seen corresponding path program 1 times [2022-04-18 17:18:45,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294974830] [2022-04-18 17:18:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:45,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:18:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:45,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:18:45,276 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:18:45,276 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-04-18 17:18:45,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 17:18:45,277 INFO L719 BasicCegarLoop]: Path program histogram: [1] [2022-04-18 17:18:45,277 INFO L306 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2022-04-18 17:18:45,278 WARN L232 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 17:18:45,278 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-04-18 17:18:45,303 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:45,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:45,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:45,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:45,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-04-18 17:18:45,308 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-04-18 17:18:45,308 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-18 17:18:45,308 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-18 17:18:45,373 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash 871127405, now seen corresponding path program 1 times [2022-04-18 17:18:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:45,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175383434] [2022-04-18 17:18:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:18:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175383434] [2022-04-18 17:18:45,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175383434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:45,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:45,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223665686] [2022-04-18 17:18:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:45,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:45,390 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:45,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:45,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:45,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 17:18:45,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash 928016785, now seen corresponding path program 1 times [2022-04-18 17:18:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:45,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49592588] [2022-04-18 17:18:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:45,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:18:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:45,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:18:45,471 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:18:45,471 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-04-18 17:18:45,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 17:18:45,474 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-18 17:18:45,474 INFO L306 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2022-04-18 17:18:45,474 WARN L232 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 17:18:45,474 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-04-18 17:18:45,519 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:45,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:45,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-04-18 17:18:45,533 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2022-04-18 17:18:45,534 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-18 17:18:45,534 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-04-18 17:18:45,653 WARN L322 ript$VariableManager]: TermVariabe |v_#race_302| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:46,918 WARN L322 ript$VariableManager]: TermVariabe |v_#race_310| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:46,931 WARN L322 ript$VariableManager]: TermVariabe |v_#race_312| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:48,472 WARN L322 ript$VariableManager]: TermVariabe |v_#race_302| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:48,490 WARN L322 ript$VariableManager]: TermVariabe |v_#race_304| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-04-18 17:18:50,230 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -883074293, now seen corresponding path program 1 times [2022-04-18 17:18:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128249455] [2022-04-18 17:18:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-18 17:18:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128249455] [2022-04-18 17:18:50,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128249455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:50,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:50,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526950890] [2022-04-18 17:18:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:50,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:50,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:50,267 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:50,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:50,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:54,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 17:18:54,747 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1904429492, now seen corresponding path program 1 times [2022-04-18 17:18:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:54,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683209391] [2022-04-18 17:18:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:54,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683209391] [2022-04-18 17:18:54,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683209391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:18:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10949588] [2022-04-18 17:18:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:54,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:54,816 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:54,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:54,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:59,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 17:18:59,127 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1964032553, now seen corresponding path program 1 times [2022-04-18 17:18:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:59,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587739131] [2022-04-18 17:18:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:59,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587739131] [2022-04-18 17:18:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587739131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:59,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93997218] [2022-04-18 17:18:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:59,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,212 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:59,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:59,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:59,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:59,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 17:18:59,250 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash 285334606, now seen corresponding path program 1 times [2022-04-18 17:18:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:59,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296545912] [2022-04-18 17:18:59,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296545912] [2022-04-18 17:18:59,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296545912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:18:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670646874] [2022-04-18 17:18:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:59,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:59,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:18:59,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 17:18:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:59,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 17:18:59,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:18:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:59,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:18:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:59,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670646874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:18:59,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:18:59,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-04-18 17:18:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901723739] [2022-04-18 17:18:59,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:18:59,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 17:18:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:59,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 17:18:59,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 17:18:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,683 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:59,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:59,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:59,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:59,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:59,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-18 17:18:59,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-18 17:18:59,945 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash -34622964, now seen corresponding path program 2 times [2022-04-18 17:18:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895554350] [2022-04-18 17:18:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-04-18 17:19:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:00,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895554350] [2022-04-18 17:19:00,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895554350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:19:00,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:19:00,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:19:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197278210] [2022-04-18 17:19:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:19:00,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:19:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:19:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:19:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:00,015 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:00,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:00,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:00,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:00,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:00,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:00,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 17:19:06,330 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:19:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:19:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -473281791, now seen corresponding path program 1 times [2022-04-18 17:19:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:19:06,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655593320] [2022-04-18 17:19:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:19:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-04-18 17:19:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655593320] [2022-04-18 17:19:06,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655593320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:19:06,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:19:06,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:19:06,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443840474] [2022-04-18 17:19:06,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:19:06,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:19:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:06,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:19:06,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:19:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:06,453 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:06,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:06,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 17:19:53,595 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:19:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:19:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1294122989, now seen corresponding path program 1 times [2022-04-18 17:19:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:19:53,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537350882] [2022-04-18 17:19:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:19:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:19:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:53,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537350882] [2022-04-18 17:19:53,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537350882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:19:53,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:19:53,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:19:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909941090] [2022-04-18 17:19:53,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:19:53,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:19:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:53,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:19:53,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:19:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:53,656 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:53,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:53,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:53,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:53,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:53,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:01,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 17:20:01,771 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1033748191, now seen corresponding path program 1 times [2022-04-18 17:20:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:01,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687477675] [2022-04-18 17:20:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:20:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:20:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687477675] [2022-04-18 17:20:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687477675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:20:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351316262] [2022-04-18 17:20:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:01,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:01,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:20:01,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:20:01,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 17:20:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 17:20:01,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:20:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:20:02,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:20:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:20:02,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351316262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:20:02,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:20:02,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-04-18 17:20:02,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931465145] [2022-04-18 17:20:02,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:20:02,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 17:20:02,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:20:02,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 17:20:02,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 17:20:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:02,347 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:20:02,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:20:02,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:02,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:02,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:02,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:12,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:12,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-18 17:20:12,732 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 187226488, now seen corresponding path program 1 times [2022-04-18 17:20:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:12,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923327604] [2022-04-18 17:20:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:20:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:20:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923327604] [2022-04-18 17:20:14,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923327604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:20:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386804614] [2022-04-18 17:20:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:14,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:14,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:20:14,782 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:20:14,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 17:20:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:15,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-18 17:20:15,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:20:15,735 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:20:15,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:20:15,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:16,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:16,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:17,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:20:20,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:20:20,342 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 17:20:20,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-04-18 17:20:20,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_927 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_927) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4))) (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) (select .cse0 (+ .cse1 |c_~#storage~0.offset|))))) is different from false [2022-04-18 17:20:20,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_927 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_927) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) (select .cse0 (+ .cse1 |c_~#storage~0.offset|))))) is different from false [2022-04-18 17:20:20,965 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_927 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_927) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) (select .cse0 (+ .cse1 |c_~#storage~0.offset|))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:20:21,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_927 (Array Int Int)) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= 6 .cse0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_927) |c_~#storage~0.base|)) (.cse2 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8))) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) (select .cse1 (+ .cse2 |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:20:22,239 INFO L356 Elim1Store]: treesize reduction 349, result has 2.5 percent of original size [2022-04-18 17:20:22,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 61 [2022-04-18 17:20:22,246 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 17:20:22,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 3 [2022-04-18 17:20:22,294 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:20:22,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:20:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 22 not checked. [2022-04-18 17:20:22,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386804614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:20:22,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:20:22,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 25] total 74 [2022-04-18 17:20:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869567345] [2022-04-18 17:20:22,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:20:22,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-18 17:20:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:20:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-18 17:20:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=4363, Unknown=22, NotChecked=556, Total=5402 [2022-04-18 17:20:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:22,343 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:20:22,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 5.6891891891891895) internal successors, (421), 74 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:22,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:20:25,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:25,701 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:25,701 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1795472061, now seen corresponding path program 1 times [2022-04-18 17:20:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040818153] [2022-04-18 17:20:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:20:27,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:20:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040818153] [2022-04-18 17:20:27,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040818153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:20:27,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321189681] [2022-04-18 17:20:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:20:27,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:20:27,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-18 17:20:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:28,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 17:20:28,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:20:28,719 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:20:28,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:20:28,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:29,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:29,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:29,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-04-18 17:20:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 17:20:33,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:20:33,492 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 17:20:33,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-04-18 17:20:34,329 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1144) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread3of3ForFork0_~offset~0#1| 4))) (<= (select .cse0 (+ 4 .cse1 |c_~#storage~0.offset|)) (select .cse0 (+ .cse1 |c_~#storage~0.offset|))))) (= |c_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:20:34,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1144) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) (select .cse1 (+ .cse2 |c_~#storage~0.offset|)))) (<= 6 .cse0)))) is different from false [2022-04-18 17:20:35,914 INFO L356 Elim1Store]: treesize reduction 297, result has 17.0 percent of original size [2022-04-18 17:20:35,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 113 [2022-04-18 17:20:35,925 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 17:20:35,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-04-18 17:20:36,064 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:20:36,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:20:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 9 not checked. [2022-04-18 17:20:36,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321189681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:20:36,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:20:36,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 25] total 79 [2022-04-18 17:20:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054952511] [2022-04-18 17:20:36,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:20:36,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-18 17:20:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:20:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-18 17:20:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=5416, Unknown=3, NotChecked=302, Total=6162 [2022-04-18 17:20:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:36,105 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:20:36,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 5.544303797468355) internal successors, (438), 79 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:20:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:36,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:36,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:36,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:36,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:20:36,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:20:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:20:42,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-18 17:20:42,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:42,925 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1515276248, now seen corresponding path program 1 times [2022-04-18 17:20:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:42,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606570628] [2022-04-18 17:20:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:42,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:20:43,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:20:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:20:43,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:20:43,140 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-04-18 17:20:43,141 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-04-18 17:20:43,142 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-04-18 17:20:43,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-18 17:20:43,144 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 17:20:43,144 INFO L306 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2022-04-18 17:20:43,147 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-04-18 17:20:43,147 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 17:20:43,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 05:20:43 BasicIcfg [2022-04-18 17:20:43,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 17:20:43,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 17:20:43,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 17:20:43,324 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 17:20:43,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:18:30" (3/4) ... [2022-04-18 17:20:43,326 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 17:20:43,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 17:20:43,327 INFO L158 Benchmark]: Toolchain (without parser) took 133586.21ms. Allocated memory was 117.4MB in the beginning and 362.8MB in the end (delta: 245.4MB). Free memory was 86.1MB in the beginning and 108.4MB in the end (delta: -22.2MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,327 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:20:43,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.44ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 80.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.50ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 77.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,327 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,328 INFO L158 Benchmark]: RCFGBuilder took 546.87ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 75.7MB in the beginning and 133.6MB in the end (delta: -57.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,330 INFO L158 Benchmark]: TraceAbstraction took 132539.22ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 133.1MB in the beginning and 108.4MB in the end (delta: 24.8MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2022-04-18 17:20:43,331 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 362.8MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:20:43,332 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.44ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 80.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.50ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 77.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.87ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 75.7MB in the beginning and 133.6MB in the end (delta: -57.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 132539.22ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 133.1MB in the beginning and 108.4MB in the end (delta: 24.8MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 362.8MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5066, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 617, negative conditional: 549, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4529, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 80, negative conditional: 12, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4529, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 80, negative conditional: 12, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 963, positive unconditional: 3486, negative: 94, negative conditional: 14, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 576, positive unconditional: 3873, negative: 94, negative conditional: 11, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 576, positive unconditional: 3873, negative: 94, negative conditional: 11, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2530, positive: 2453, positive conditional: 7, positive unconditional: 2446, negative: 77, negative conditional: 8, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2530, positive: 2393, positive conditional: 0, positive unconditional: 2393, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 137, positive: 60, positive conditional: 2, positive unconditional: 58, negative: 69, negative conditional: 4, negative unconditional: 65, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11648, positive: 374, positive conditional: 139, positive unconditional: 236, negative: 285, negative conditional: 101, negative unconditional: 183, unknown: 10989, unknown conditional: 6654, unknown unconditional: 4335] ], Cache Queries: [ total: 4543, positive: 1996, positive conditional: 569, positive unconditional: 1427, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 2530, unknown conditional: 15, unknown unconditional: 2515] , Statistics on independence cache: Total cache size (in pairs): 2530, Positive cache size: 2453, Positive conditional cache size: 7, Positive unconditional cache size: 2446, Negative cache size: 77, Negative conditional cache size: 8, Negative unconditional cache size: 69, Eliminated conditions: 390, Maximal queried relation: 2, Independence queries for same thread: 537 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 3.2s, Number of persistent set computation: 555, Number of trivial persistent sets: 531, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3163, positive: 3095, positive conditional: 0, positive unconditional: 3095, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5066, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 617, negative conditional: 549, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4529, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 80, negative conditional: 12, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4529, positive: 4449, positive conditional: 1354, positive unconditional: 3095, negative: 80, negative conditional: 12, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 963, positive unconditional: 3486, negative: 94, negative conditional: 14, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 576, positive unconditional: 3873, negative: 94, negative conditional: 11, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4543, positive: 4449, positive conditional: 576, positive unconditional: 3873, negative: 94, negative conditional: 11, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2530, positive: 2453, positive conditional: 7, positive unconditional: 2446, negative: 77, negative conditional: 8, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2530, positive: 2393, positive conditional: 0, positive unconditional: 2393, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 137, positive: 60, positive conditional: 2, positive unconditional: 58, negative: 69, negative conditional: 4, negative unconditional: 65, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11648, positive: 374, positive conditional: 139, positive unconditional: 236, negative: 285, negative conditional: 101, negative unconditional: 183, unknown: 10989, unknown conditional: 6654, unknown unconditional: 4335] ], Cache Queries: [ total: 4543, positive: 1996, positive conditional: 569, positive unconditional: 1427, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 2530, unknown conditional: 15, unknown unconditional: 2515] , Statistics on independence cache: Total cache size (in pairs): 2530, Positive cache size: 2453, Positive conditional cache size: 7, Positive unconditional cache size: 2446, Negative cache size: 77, Negative conditional cache size: 8, Negative unconditional cache size: 69, Eliminated conditions: 390, Maximal queried relation: 2, Independence queries for same thread: 537 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 765, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 765, positive: 755, positive conditional: 0, positive unconditional: 755, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 829, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 765, unknown conditional: 0, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 762, Positive conditional cache size: 0, Positive unconditional cache size: 762, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 43, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 813, positive: 810, positive conditional: 0, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 16, positive unconditional: 810, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 829, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 765, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 765, positive: 755, positive conditional: 0, positive unconditional: 755, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 829, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 765, unknown conditional: 0, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 762, Positive conditional cache size: 0, Positive unconditional cache size: 762, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4137, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 22, negative conditional: 12, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3789, positive: 3779, positive conditional: 0, positive unconditional: 3779, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3789, positive: 3761, positive conditional: 0, positive unconditional: 3761, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4125, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3789, unknown conditional: 0, unknown unconditional: 3789] , Statistics on independence cache: Total cache size (in pairs): 3789, Positive cache size: 3779, Positive conditional cache size: 0, Positive unconditional cache size: 3779, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 73, Number of trivial persistent sets: 55, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3966, positive: 3956, positive conditional: 0, positive unconditional: 3956, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4137, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 22, negative conditional: 12, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 159, positive unconditional: 3956, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4125, positive: 4115, positive conditional: 0, positive unconditional: 4115, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3789, positive: 3779, positive conditional: 0, positive unconditional: 3779, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3789, positive: 3761, positive conditional: 0, positive unconditional: 3761, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4125, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3789, unknown conditional: 0, unknown unconditional: 3789] , Statistics on independence cache: Total cache size (in pairs): 3789, Positive cache size: 3779, Positive conditional cache size: 0, Positive unconditional cache size: 3779, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 41025, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 1523, negative conditional: 1305, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39752, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 250, negative conditional: 32, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39752, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 250, negative conditional: 32, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 5234, positive unconditional: 34268, negative: 290, negative conditional: 40, negative unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 2445, positive unconditional: 37057, negative: 290, negative conditional: 37, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 2445, positive unconditional: 37057, negative: 290, negative conditional: 37, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29078, positive: 28833, positive conditional: 9, positive unconditional: 28824, negative: 245, negative conditional: 26, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29078, positive: 28343, positive conditional: 0, positive unconditional: 28343, negative: 735, negative conditional: 0, negative unconditional: 735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 735, positive: 490, positive conditional: 4, positive unconditional: 486, negative: 197, negative conditional: 10, negative unconditional: 187, unknown: 48, unknown conditional: 16, unknown unconditional: 32] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83724, positive: 3899, positive conditional: 206, positive unconditional: 3694, negative: 1021, negative conditional: 176, negative unconditional: 845, unknown: 78804, unknown conditional: 25160, unknown unconditional: 53644] ], Cache Queries: [ total: 39792, positive: 10669, positive conditional: 2436, positive unconditional: 8233, negative: 45, negative conditional: 11, negative unconditional: 34, unknown: 29078, unknown conditional: 35, unknown unconditional: 29043] , Statistics on independence cache: Total cache size (in pairs): 29078, Positive cache size: 28833, Positive conditional cache size: 9, Positive unconditional cache size: 28824, Negative cache size: 245, Negative conditional cache size: 26, Negative unconditional cache size: 219, Eliminated conditions: 2792, Maximal queried relation: 4, Independence queries for same thread: 1273 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 56.4s, Number of persistent set computation: 811, Number of trivial persistent sets: 697, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31197, positive: 30979, positive conditional: 0, positive unconditional: 30979, negative: 218, negative conditional: 0, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 41025, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 1523, negative conditional: 1305, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39752, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 250, negative conditional: 32, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39752, positive: 39502, positive conditional: 8523, positive unconditional: 30979, negative: 250, negative conditional: 32, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 5234, positive unconditional: 34268, negative: 290, negative conditional: 40, negative unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 2445, positive unconditional: 37057, negative: 290, negative conditional: 37, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39792, positive: 39502, positive conditional: 2445, positive unconditional: 37057, negative: 290, negative conditional: 37, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29078, positive: 28833, positive conditional: 9, positive unconditional: 28824, negative: 245, negative conditional: 26, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29078, positive: 28343, positive conditional: 0, positive unconditional: 28343, negative: 735, negative conditional: 0, negative unconditional: 735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 735, positive: 490, positive conditional: 4, positive unconditional: 486, negative: 197, negative conditional: 10, negative unconditional: 187, unknown: 48, unknown conditional: 16, unknown unconditional: 32] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83724, positive: 3899, positive conditional: 206, positive unconditional: 3694, negative: 1021, negative conditional: 176, negative unconditional: 845, unknown: 78804, unknown conditional: 25160, unknown unconditional: 53644] ], Cache Queries: [ total: 39792, positive: 10669, positive conditional: 2436, positive unconditional: 8233, negative: 45, negative conditional: 11, negative unconditional: 34, unknown: 29078, unknown conditional: 35, unknown unconditional: 29043] , Statistics on independence cache: Total cache size (in pairs): 29078, Positive cache size: 28833, Positive conditional cache size: 9, Positive unconditional cache size: 28824, Negative cache size: 245, Negative conditional cache size: 26, Negative unconditional cache size: 219, Eliminated conditions: 2792, Maximal queried relation: 4, Independence queries for same thread: 1273 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 720]: Data race detected Data race detected The following path leads to a data race: [L704] 0 volatile int max = 0x80000000; VAL [max={3:0}] [L705] 0 int storage[2*3]; VAL [max={3:0}, storage={4:0}] [L739] 0 pthread_t t; VAL [max={3:0}, storage={4:0}, t={35:0}] [L740] COND TRUE 0 1 VAL [max={3:0}, storage={4:0}, t={35:0}] [L740] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [max={3:0}, pthread_create(&t, 0, thr1, 0)=26, storage={4:0}, t={35:0}] [L733] 1 int offset=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, arg={0:0}, arg={0:0}, max={3:0}, offset=1, storage={4:0}] [L740] COND TRUE 0 1 VAL [max={3:0}, storage={4:0}, t={35:0}] [L734] CALL 1 assume_abort_if_not(offset % 2 == 0 && offset >= 0 && offset < 2*3) [L740] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [max={3:0}, pthread_create(&t, 0, thr1, 0)=27, storage={4:0}, t={35:0}] [L3] COND TRUE 1 !cond VAL [\old(cond)=0, cond=0, max={3:0}, storage={4:0}] [L733] 2 int offset=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=4, arg={0:0}, arg={0:0}, max={3:0}, offset=4, storage={4:0}] [L740] COND TRUE 0 1 VAL [max={3:0}, storage={4:0}, t={35:0}] [L734] CALL 2 assume_abort_if_not(offset % 2 == 0 && offset >= 0 && offset < 2*3) [L740] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [max={3:0}, pthread_create(&t, 0, thr1, 0)=28, storage={4:0}, t={35:0}] [L3] COND FALSE 2 !(!cond) VAL [\old(cond)=0, cond=1, max={3:0}, storage={4:0}] [L733] 3 int offset=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, max={3:0}, offset=0, storage={4:0}] [L734] RET 2 assume_abort_if_not(offset % 2 == 0 && offset >= 0 && offset < 2*3) [L740] COND TRUE 0 1 VAL [max={3:0}, storage={4:0}, t={35:0}] [L735] CALL 2 findMax(offset) [L734] CALL 3 assume_abort_if_not(offset % 2 == 0 && offset >= 0 && offset < 2*3) [L740] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [max={3:0}, pthread_create(&t, 0, thr1, 0)=29, storage={4:0}, t={35:0}] [L707] 2 int i; VAL [\old(offset)=4, max={3:0}, offset=4, storage={4:0}] [L3] COND FALSE 3 !(!cond) VAL [\old(cond)=1, cond=1, max={3:0}, storage={4:0}] [L708] 2 int e; VAL [\old(offset)=4, max={3:0}, offset=4, storage={4:0}] [L709] 2 int my_max = 0x80000000; VAL [\old(offset)=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}] [L734] RET 3 assume_abort_if_not(offset % 2 == 0 && offset >= 0 && offset < 2*3) [L710] 2 int c; VAL [\old(offset)=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}] [L735] CALL 3 findMax(offset) [L711] 2 int cret; VAL [\old(offset)=4, cret={25:0}, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}] [L712] 2 i = offset VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}] [L712] COND TRUE 2 i < offset+2 VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}] [L713] EXPR 2 storage[i] VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L707] 3 int i; VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L708] 3 int e; VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L709] 3 int my_max = 0x80000000; VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L710] 3 int c; VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={25:0}, i=4, max={3:0}, my_max=-2147483648, offset=0, storage={4:0}, storage[i]=0] [L711] 3 int cret; VAL [\old(offset)=4, cret={36:0}, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L712] 3 i = offset VAL [\old(offset)=4, cret={36:0}, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L712] COND TRUE 3 i < offset+2 VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L714] COND TRUE 2 e > my_max VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L715] 2 my_max = e VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L717] COND FALSE 2 !(!(e <= my_max)) VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L712] 2 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=4, i++=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=4, i++=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L712] 2 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=4, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L712] COND TRUE 2 i < offset+2 VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L714] COND TRUE 3 e > my_max VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=-2147483648, offset=4, storage={4:0}, storage[i]=0] [L715] 3 my_max = e VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L717] COND FALSE 3 !(!(e <= my_max)) VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] 3 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=0, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=0, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] 3 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=0, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=0, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 2 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] COND TRUE 3 i < offset+2 VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L714] COND FALSE 2 !(e > my_max) VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L717] COND FALSE 2 !(!(e <= my_max)) VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] 2 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=5, i++=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] 2 i++ VAL [\old(offset)=4, cret={36:0}, e=0, i=6, i++=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=6, i++=5, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L713] 3 e = storage[i] VAL [\old(offset)=4, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L712] COND FALSE 2 !(i < offset+2) VAL [\old(offset)=4, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}, storage[i]=0] [L719] COND TRUE 2 1 VAL [\old(offset)=4, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L714] COND FALSE 3 !(e > my_max) VAL [\old(offset)=4, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] EXPR 2 \read(max) VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L717] COND FALSE 3 !(!(e <= my_max)) VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L712] 3 i++ VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, i++=1, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, i++=1, max={3:0}, my_max=0, offset=4, storage={4:0}] [L712] 3 i++ VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, i++=1, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, i++=1, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L712] COND FALSE 3 !(i < offset+2) VAL [\old(offset)=4, \read(max)=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 2 c = max VAL [\old(offset)=4, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L719] COND TRUE 3 1 VAL [\old(offset)=4, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L721] COND TRUE 2 my_max > c VAL [\old(offset)=4, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 3 c = max VAL [\old(offset)=4, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L722] CALL 2 __VERIFIER_atomic_CAS(&max,c,my_max,&cret) [L695] EXPR 2 \read(*v) [L695] 2 *v == e [L695] COND TRUE 2 *v == e [L697] 2 *v = u [L697] 2 *r = 1 [L722] RET 2 __VERIFIER_atomic_CAS(&max,c,my_max,&cret) [L720] 3 c = max VAL [\old(offset)=4, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L723] 2 \read(cret) VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 3 c = max VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L723] 2 \read(cret) VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 3 c = max VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L723] 2 \read(cret) VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] [L720] 3 c = max VAL [\old(offset)=4, \read(cret)=1, \read(max)=-2147483648, c=-2147483648, cret={36:0}, e=0, i=6, max={3:0}, my_max=0, offset=4, storage={4:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *v = u [697] * C: *r = 0 [701] * C: *r = 0 [701] * C: *r = 1 [697] * C: *r = 1 [697] * C: *r = 0 [701] * C: *v = u [697] * C: *r = 1 [697] * C: *r = 1 [697] * C: *r = 0 [701] * C: *v = u [697] * C: *v = u [697] and C: c = max [720] - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 200 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 12.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 29, 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.7s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1007 SizeOfPredicates, 2 NumberOfNonLiveVariables, 199 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 70/73 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 200 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 281 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 17/17 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread3of3ForFork0 with 1 thread instances CFG has 5 procedures, 362 locations, 33 error locations. Started 1 CEGAR loops. OverallTime: 117.6s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 95.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 107, 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.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2565 ConstructedInterpolants, 159 QuantifiedInterpolants, 46461 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1749 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 683/898 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-18 17:20:43,851 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forcibly destroying the process [2022-04-18 17:20:43,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 137 [2022-04-18 17:20:43,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:44,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:44,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:44,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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