./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.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/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 15:52:29,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 15:52:29,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 15:52:29,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 15:52:29,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 15:52:29,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 15:52:29,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 15:52:29,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 15:52:29,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 15:52:29,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 15:52:29,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 15:52:29,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 15:52:29,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 15:52:29,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 15:52:29,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 15:52:29,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 15:52:29,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 15:52:29,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 15:52:29,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 15:52:29,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 15:52:29,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 15:52:29,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 15:52:29,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 15:52:29,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 15:52:29,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 15:52:29,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 15:52:29,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 15:52:29,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 15:52:29,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 15:52:29,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 15:52:29,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 15:52:29,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 15:52:29,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 15:52:29,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 15:52:29,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 15:52:29,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 15:52:29,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 15:52:29,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 15:52:29,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 15:52:29,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 15:52:29,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 15:52:29,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 15:52:29,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 15:52:29,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 15:52:29,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 15:52:29,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 15:52:29,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 15:52:29,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 15:52:29,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 15:52:29,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 15:52:29,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 15:52:29,802 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 15:52:29,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 15:52:29,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 15:52:29,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 15:52:29,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 15:52:29,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 15:52:29,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 15:52:29,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 15:52:29,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 15:52:29,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 15:52:29,804 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 15:52:29,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 15:52:29,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 15:52:29,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 15:52:29,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 15:52:29,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 15:52:29,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 15:52:29,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 15:52:29,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:52:29,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 15:52:29,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 15:52:29,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 15:52:29,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 15:52:29,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 15:52:29,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 15:52:29,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 15:52:29,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 15:52:29,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 [2022-04-18 15:52:30,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 15:52:30,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 15:52:30,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 15:52:30,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 15:52:30,062 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 15:52:30,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i [2022-04-18 15:52:30,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62425c3a8/b2227c888555425eb442ed35dc86866d/FLAG591fdc07c [2022-04-18 15:52:30,524 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 15:52:30,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i [2022-04-18 15:52:30,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62425c3a8/b2227c888555425eb442ed35dc86866d/FLAG591fdc07c [2022-04-18 15:52:30,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62425c3a8/b2227c888555425eb442ed35dc86866d [2022-04-18 15:52:30,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 15:52:30,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 15:52:30,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 15:52:30,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 15:52:30,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 15:52:30,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:52:30" (1/1) ... [2022-04-18 15:52:30,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e2cb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:30, skipping insertion in model container [2022-04-18 15:52:30,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:52:30" (1/1) ... [2022-04-18 15:52:30,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 15:52:30,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 15:52:31,248 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-deagle/airline-5.i[32089,32102] [2022-04-18 15:52:31,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:52:31,258 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 15:52:31,310 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-deagle/airline-5.i[32089,32102] [2022-04-18 15:52:31,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:52:31,349 INFO L208 MainTranslator]: Completed translation [2022-04-18 15:52:31,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31 WrapperNode [2022-04-18 15:52:31,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 15:52:31,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 15:52:31,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 15:52:31,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 15:52:31,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,409 INFO L137 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-04-18 15:52:31,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 15:52:31,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 15:52:31,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 15:52:31,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 15:52:31,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 15:52:31,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 15:52:31,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 15:52:31,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 15:52:31,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (1/1) ... [2022-04-18 15:52:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:52:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:52:31,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 15:52:31,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 15:52:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 15:52:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 15:52:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 15:52:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 15:52:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 15:52:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-04-18 15:52:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-04-18 15:52:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 15:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 15:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 15:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 15:52:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 15:52:31,509 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 15:52:31,598 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 15:52:31,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 15:52:31,808 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 15:52:31,835 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 15:52:31,835 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-18 15:52:31,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:31 BoogieIcfgContainer [2022-04-18 15:52:31,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 15:52:31,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 15:52:31,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 15:52:31,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 15:52:31,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:52:30" (1/3) ... [2022-04-18 15:52:31,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552ac235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:52:31, skipping insertion in model container [2022-04-18 15:52:31,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:31" (2/3) ... [2022-04-18 15:52:31,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552ac235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:52:31, skipping insertion in model container [2022-04-18 15:52:31,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:31" (3/3) ... [2022-04-18 15:52:31,860 INFO L111 eAbstractionObserver]: Analyzing ICFG airline-5.i [2022-04-18 15:52:31,865 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 15:52:31,865 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 15:52:31,865 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-04-18 15:52:31,865 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 15:52:31,939 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 15:52:32,006 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:52:32,015 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=PETRI_NET, 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 15:52:32,015 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-04-18 15:52:32,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-04-18 15:52:32,097 INFO L129 PetriNetUnfolder]: 9/119 cut-off events. [2022-04-18 15:52:32,098 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 15:52:32,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 119 events. 9/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 246 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-04-18 15:52:32,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-04-18 15:52:32,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-04-18 15:52:32,116 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2022-04-18 15:52:32,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:52:32,116 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:32,117 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:32,118 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-04-18 15:52:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301244, now seen corresponding path program 1 times [2022-04-18 15:52:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:32,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694529295] [2022-04-18 15:52:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694529295] [2022-04-18 15:52:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694529295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:32,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:32,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-04-18 15:52:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713148510] [2022-04-18 15:52:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:32,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 15:52:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 15:52:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 15:52:32,366 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-04-18 15:52:32,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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 15:52:32,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:32,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-04-18 15:52:32,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:32,405 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2022-04-18 15:52:32,406 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-04-18 15:52:32,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 106 events. 3/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 222 event pairs, 0 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 50. Up to 8 conditions per place. [2022-04-18 15:52:32,408 INFO L132 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-04-18 15:52:32,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-04-18 15:52:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 15:52:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-04-18 15:52:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-04-18 15:52:32,421 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-04-18 15:52:32,421 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-04-18 15:52:32,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-04-18 15:52:32,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:32,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-04-18 15:52:32,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 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 15:52:32,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 15:52:32,438 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 15:52:32,440 INFO L186 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-04-18 15:52:32,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-04-18 15:52:32,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:32,452 INFO L242 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-04-18 15:52:32,454 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2022-04-18 15:52:32,458 INFO L335 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-04-18 15:52:32,459 INFO L478 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-04-18 15:52:32,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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 15:52:32,460 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:32,460 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:32,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 15:52:32,461 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-04-18 15:52:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1828019146, now seen corresponding path program 1 times [2022-04-18 15:52:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130231284] [2022-04-18 15:52:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:32,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:32,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130231284] [2022-04-18 15:52:32,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130231284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:32,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:32,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 15:52:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354930515] [2022-04-18 15:52:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:32,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:32,558 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-04-18 15:52:32,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 15:52:32,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:32,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-04-18 15:52:32,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:32,655 INFO L129 PetriNetUnfolder]: 12/148 cut-off events. [2022-04-18 15:52:32,655 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 15:52:32,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 148 events. 12/148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 344 event pairs, 3 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 185. Up to 23 conditions per place. [2022-04-18 15:52:32,658 INFO L132 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-04-18 15:52:32,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-04-18 15:52:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-04-18 15:52:32,662 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-04-18 15:52:32,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-04-18 15:52:32,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-04-18 15:52:32,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:32,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-04-18 15:52:32,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 15:52:32,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,669 INFO L186 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-04-18 15:52:32,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-04-18 15:52:32,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:32,673 INFO L242 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-04-18 15:52:32,673 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2022-04-18 15:52:32,674 INFO L335 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-04-18 15:52:32,674 INFO L478 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-04-18 15:52:32,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 15:52:32,675 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:32,675 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:32,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 15:52:32,676 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-04-18 15:52:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash -311906661, now seen corresponding path program 1 times [2022-04-18 15:52:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:32,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534197212] [2022-04-18 15:52:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534197212] [2022-04-18 15:52:32,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534197212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:32,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:32,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:32,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430415337] [2022-04-18 15:52:32,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:32,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:32,746 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-04-18 15:52:32,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 15:52:32,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:32,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-04-18 15:52:32,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:32,788 INFO L129 PetriNetUnfolder]: 1/131 cut-off events. [2022-04-18 15:52:32,789 INFO L130 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-04-18 15:52:32,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 131 events. 1/131 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 150. Up to 7 conditions per place. [2022-04-18 15:52:32,790 INFO L132 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-04-18 15:52:32,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-04-18 15:52:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-04-18 15:52:32,796 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-04-18 15:52:32,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-04-18 15:52:32,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-04-18 15:52:32,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:32,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-04-18 15:52:32,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 15:52:32,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,800 INFO L186 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-04-18 15:52:32,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-04-18 15:52:32,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:32,804 INFO L242 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-04-18 15:52:32,804 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2022-04-18 15:52:32,805 INFO L335 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-04-18 15:52:32,805 INFO L478 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-04-18 15:52:32,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 15:52:32,805 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:32,806 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:32,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 15:52:32,806 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-04-18 15:52:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1996792538, now seen corresponding path program 1 times [2022-04-18 15:52:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691708557] [2022-04-18 15:52:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:32,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691708557] [2022-04-18 15:52:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691708557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:32,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:32,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860693471] [2022-04-18 15:52:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:32,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:32,884 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-04-18 15:52:32,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 15:52:32,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:32,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-04-18 15:52:32,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:32,943 INFO L129 PetriNetUnfolder]: 7/188 cut-off events. [2022-04-18 15:52:32,943 INFO L130 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-04-18 15:52:32,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 188 events. 7/188 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 578 event pairs, 4 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 231. Up to 23 conditions per place. [2022-04-18 15:52:32,945 INFO L132 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-04-18 15:52:32,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-04-18 15:52:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-04-18 15:52:32,946 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-04-18 15:52:32,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-04-18 15:52:32,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-04-18 15:52:32,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:32,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-04-18 15:52:32,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 15:52:32,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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 15:52:32,949 INFO L186 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-04-18 15:52:32,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-04-18 15:52:32,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:32,955 INFO L242 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-04-18 15:52:32,955 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2022-04-18 15:52:32,957 INFO L335 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-04-18 15:52:32,958 INFO L478 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-04-18 15:52:32,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 15:52:32,959 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:32,959 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:32,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 15:52:32,960 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-04-18 15:52:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 476877077, now seen corresponding path program 1 times [2022-04-18 15:52:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:32,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805254523] [2022-04-18 15:52:32,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:32,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:52:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:33,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:52:33,025 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:52:33,026 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-04-18 15:52:33,028 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-04-18 15:52:33,029 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-04-18 15:52:33,029 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-04-18 15:52:33,029 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-04-18 15:52:33,029 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-04-18 15:52:33,029 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-04-18 15:52:33,030 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-04-18 15:52:33,030 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-04-18 15:52:33,030 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-04-18 15:52:33,030 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-04-18 15:52:33,030 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-04-18 15:52:33,031 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-04-18 15:52:33,031 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-04-18 15:52:33,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 15:52:33,035 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-18 15:52:33,037 WARN L232 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 15:52:33,037 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-04-18 15:52:33,054 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-04-18 15:52:33,056 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:52:33,057 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=PETRI_NET, 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 15:52:33,057 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-18 15:52:33,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-04-18 15:52:33,082 INFO L129 PetriNetUnfolder]: 18/209 cut-off events. [2022-04-18 15:52:33,082 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 15:52:33,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 209 events. 18/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-04-18 15:52:33,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-04-18 15:52:33,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-04-18 15:52:33,090 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2022-04-18 15:52:33,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:52:33,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:33,091 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:33,091 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1695734104, now seen corresponding path program 1 times [2022-04-18 15:52:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672025744] [2022-04-18 15:52:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672025744] [2022-04-18 15:52:33,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672025744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:33,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:33,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-04-18 15:52:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802030734] [2022-04-18 15:52:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:33,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 15:52:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 15:52:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 15:52:33,144 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-04-18 15:52:33,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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 15:52:33,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:33,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-04-18 15:52:33,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:33,191 INFO L129 PetriNetUnfolder]: 16/208 cut-off events. [2022-04-18 15:52:33,191 INFO L130 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2022-04-18 15:52:33,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 208 events. 16/208 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 649 event pairs, 1 based on Foata normal form. 18/197 useless extension candidates. Maximal degree in co-relation 116. Up to 27 conditions per place. [2022-04-18 15:52:33,194 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-04-18 15:52:33,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-04-18 15:52:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 15:52:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-04-18 15:52:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-04-18 15:52:33,196 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-04-18 15:52:33,196 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-04-18 15:52:33,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-04-18 15:52:33,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:33,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-04-18 15:52:33,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 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 15:52:33,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 15:52:33,198 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 15:52:33,198 INFO L186 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-04-18 15:52:33,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-04-18 15:52:33,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:33,203 INFO L242 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-04-18 15:52:33,204 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2022-04-18 15:52:33,207 INFO L335 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-04-18 15:52:33,207 INFO L478 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-04-18 15:52:33,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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 15:52:33,208 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:33,208 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:33,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 15:52:33,208 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -708223178, now seen corresponding path program 1 times [2022-04-18 15:52:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:33,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521707728] [2022-04-18 15:52:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:33,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521707728] [2022-04-18 15:52:33,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521707728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:33,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:33,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 15:52:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819685193] [2022-04-18 15:52:33,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:33,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:33,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:33,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:33,260 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-04-18 15:52:33,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 15:52:33,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:33,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-04-18 15:52:33,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:33,352 INFO L129 PetriNetUnfolder]: 68/423 cut-off events. [2022-04-18 15:52:33,352 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-04-18 15:52:33,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 423 events. 68/423 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2068 event pairs, 9 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 562. Up to 103 conditions per place. [2022-04-18 15:52:33,356 INFO L132 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-04-18 15:52:33,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-04-18 15:52:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-04-18 15:52:33,359 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-04-18 15:52:33,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-04-18 15:52:33,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-04-18 15:52:33,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:33,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-04-18 15:52:33,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 15:52:33,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,362 INFO L186 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-04-18 15:52:33,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-04-18 15:52:33,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:33,366 INFO L242 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-04-18 15:52:33,366 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2022-04-18 15:52:33,367 INFO L335 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-04-18 15:52:33,368 INFO L478 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-04-18 15:52:33,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 15:52:33,368 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:33,368 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:33,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 15:52:33,369 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash -441666231, now seen corresponding path program 1 times [2022-04-18 15:52:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:33,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571326009] [2022-04-18 15:52:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:33,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571326009] [2022-04-18 15:52:33,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571326009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:33,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:33,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428175521] [2022-04-18 15:52:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:33,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:33,433 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-04-18 15:52:33,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 15:52:33,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:33,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-04-18 15:52:33,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:33,537 INFO L129 PetriNetUnfolder]: 52/629 cut-off events. [2022-04-18 15:52:33,537 INFO L130 PetriNetUnfolder]: For 121/304 co-relation queries the response was YES. [2022-04-18 15:52:33,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 629 events. 52/629 cut-off events. For 121/304 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3950 event pairs, 8 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 778. Up to 52 conditions per place. [2022-04-18 15:52:33,542 INFO L132 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-04-18 15:52:33,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-04-18 15:52:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-04-18 15:52:33,544 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-04-18 15:52:33,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-04-18 15:52:33,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-04-18 15:52:33,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:33,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-04-18 15:52:33,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 15:52:33,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,546 INFO L186 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-04-18 15:52:33,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-04-18 15:52:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:52:33,549 INFO L242 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-04-18 15:52:33,550 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2022-04-18 15:52:33,550 INFO L335 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-04-18 15:52:33,550 INFO L478 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-04-18 15:52:33,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 15:52:33,551 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:33,551 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:33,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 15:52:33,551 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2101498532, now seen corresponding path program 1 times [2022-04-18 15:52:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:33,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936303200] [2022-04-18 15:52:33,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936303200] [2022-04-18 15:52:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936303200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419057227] [2022-04-18 15:52:33,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:33,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:33,578 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-04-18 15:52:33,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 15:52:33,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:33,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-04-18 15:52:33,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:33,809 INFO L129 PetriNetUnfolder]: 266/1659 cut-off events. [2022-04-18 15:52:33,809 INFO L130 PetriNetUnfolder]: For 385/767 co-relation queries the response was YES. [2022-04-18 15:52:33,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1659 events. 266/1659 cut-off events. For 385/767 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14124 event pairs, 90 based on Foata normal form. 1/1411 useless extension candidates. Maximal degree in co-relation 2425. Up to 383 conditions per place. [2022-04-18 15:52:33,820 INFO L132 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-04-18 15:52:33,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-04-18 15:52:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-04-18 15:52:33,822 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-04-18 15:52:33,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-04-18 15:52:33,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-04-18 15:52:33,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:33,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-04-18 15:52:33,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 15:52:33,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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 15:52:33,824 INFO L186 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-04-18 15:52:33,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-04-18 15:52:33,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:33,828 INFO L242 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-04-18 15:52:33,829 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2022-04-18 15:52:33,829 INFO L335 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-04-18 15:52:33,829 INFO L478 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-04-18 15:52:33,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 15:52:33,830 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:33,830 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:33,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 15:52:33,830 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash 210032464, now seen corresponding path program 1 times [2022-04-18 15:52:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:33,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083206107] [2022-04-18 15:52:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:33,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083206107] [2022-04-18 15:52:33,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083206107] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:52:33,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170295616] [2022-04-18 15:52:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:52:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:52:33,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 15:52:33,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 15:52:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:33,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 15:52:33,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:52:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:34,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:52:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:34,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170295616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:52:34,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:52:34,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-04-18 15:52:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874504699] [2022-04-18 15:52:34,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:52:34,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 15:52:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:34,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 15:52:34,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-18 15:52:34,257 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-04-18 15:52:34,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 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 15:52:34,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:34,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-04-18 15:52:34,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:34,419 INFO L129 PetriNetUnfolder]: 195/620 cut-off events. [2022-04-18 15:52:34,420 INFO L130 PetriNetUnfolder]: For 444/615 co-relation queries the response was YES. [2022-04-18 15:52:34,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 620 events. 195/620 cut-off events. For 444/615 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4305 event pairs, 5 based on Foata normal form. 44/595 useless extension candidates. Maximal degree in co-relation 1381. Up to 156 conditions per place. [2022-04-18 15:52:34,426 INFO L132 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-04-18 15:52:34,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-04-18 15:52:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 15:52:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-04-18 15:52:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-04-18 15:52:34,428 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-04-18 15:52:34,428 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-04-18 15:52:34,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-04-18 15:52:34,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:34,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-04-18 15:52:34,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 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 15:52:34,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 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 15:52:34,433 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 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 15:52:34,433 INFO L186 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-04-18 15:52:34,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-04-18 15:52:34,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:34,437 INFO L242 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-04-18 15:52:34,437 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-04-18 15:52:34,437 INFO L335 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-04-18 15:52:34,438 INFO L478 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-04-18 15:52:34,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 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 15:52:34,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:34,438 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:34,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-18 15:52:34,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-18 15:52:34,652 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-04-18 15:52:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 616978764, now seen corresponding path program 1 times [2022-04-18 15:52:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:34,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493381019] [2022-04-18 15:52:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:34,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:52:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:34,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:52:34,710 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:52:34,710 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-04-18 15:52:34,710 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-04-18 15:52:34,711 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-04-18 15:52:34,711 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-04-18 15:52:34,711 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-04-18 15:52:34,711 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-04-18 15:52:34,711 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-04-18 15:52:34,712 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-04-18 15:52:34,713 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-04-18 15:52:34,713 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-04-18 15:52:34,713 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-04-18 15:52:34,714 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-04-18 15:52:34,714 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-04-18 15:52:34,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 15:52:34,715 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-18 15:52:34,715 WARN L232 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 15:52:34,715 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-04-18 15:52:34,739 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 15:52:34,742 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:52:34,743 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=PETRI_NET, 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 15:52:34,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-04-18 15:52:34,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-04-18 15:52:34,772 INFO L129 PetriNetUnfolder]: 34/360 cut-off events. [2022-04-18 15:52:34,773 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-04-18 15:52:34,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 360 events. 34/360 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1099 event pairs, 1 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-04-18 15:52:34,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-04-18 15:52:34,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-04-18 15:52:34,781 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2022-04-18 15:52:34,781 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:52:34,781 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:34,781 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:34,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash -369850584, now seen corresponding path program 1 times [2022-04-18 15:52:34,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:34,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456531411] [2022-04-18 15:52:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:34,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456531411] [2022-04-18 15:52:34,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456531411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:34,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:34,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-04-18 15:52:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377238864] [2022-04-18 15:52:34,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:34,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 15:52:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:34,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 15:52:34,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 15:52:34,801 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-04-18 15:52:34,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 15:52:34,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:34,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-04-18 15:52:34,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:34,864 INFO L129 PetriNetUnfolder]: 84/453 cut-off events. [2022-04-18 15:52:34,865 INFO L130 PetriNetUnfolder]: For 185/211 co-relation queries the response was YES. [2022-04-18 15:52:34,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 453 events. 84/453 cut-off events. For 185/211 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1939 event pairs, 19 based on Foata normal form. 57/450 useless extension candidates. Maximal degree in co-relation 317. Up to 115 conditions per place. [2022-04-18 15:52:34,870 INFO L132 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-04-18 15:52:34,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-04-18 15:52:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 15:52:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-04-18 15:52:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-04-18 15:52:34,872 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-04-18 15:52:34,872 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-04-18 15:52:34,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-04-18 15:52:34,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:34,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-04-18 15:52:34,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 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 15:52:34,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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 15:52:34,873 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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 15:52:34,874 INFO L186 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-04-18 15:52:34,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-04-18 15:52:34,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:34,876 INFO L242 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-04-18 15:52:34,876 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2022-04-18 15:52:34,877 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-04-18 15:52:34,877 INFO L478 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-04-18 15:52:34,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 15:52:34,877 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:34,877 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:34,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 15:52:34,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1058045878, now seen corresponding path program 1 times [2022-04-18 15:52:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:34,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293734424] [2022-04-18 15:52:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:34,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293734424] [2022-04-18 15:52:34,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293734424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:34,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:34,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 15:52:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006917674] [2022-04-18 15:52:34,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:34,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:34,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:34,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:34,899 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-04-18 15:52:34,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 15:52:34,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:34,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-04-18 15:52:34,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:35,067 INFO L129 PetriNetUnfolder]: 258/1209 cut-off events. [2022-04-18 15:52:35,067 INFO L130 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-04-18 15:52:35,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1209 events. 258/1209 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7881 event pairs, 58 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1666. Up to 347 conditions per place. [2022-04-18 15:52:35,078 INFO L132 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-04-18 15:52:35,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-04-18 15:52:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-04-18 15:52:35,080 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-04-18 15:52:35,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-04-18 15:52:35,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-04-18 15:52:35,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:35,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-04-18 15:52:35,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 15:52:35,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:35,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:35,082 INFO L186 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-04-18 15:52:35,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-04-18 15:52:35,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 15:52:35,085 INFO L242 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-04-18 15:52:35,085 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2022-04-18 15:52:35,086 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-04-18 15:52:35,086 INFO L478 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-04-18 15:52:35,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 15:52:35,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:35,086 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:35,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 15:52:35,086 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 836136859, now seen corresponding path program 1 times [2022-04-18 15:52:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720083928] [2022-04-18 15:52:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:35,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720083928] [2022-04-18 15:52:35,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720083928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:35,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:35,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088325282] [2022-04-18 15:52:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:35,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:35,111 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-04-18 15:52:35,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 15:52:35,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:35,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-04-18 15:52:35,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:35,536 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L721-2true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:35,536 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-04-18 15:52:35,536 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-04-18 15:52:35,536 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 98#L721-3true, 134#true, salethreadThread2of3ForFork0InUse, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:35,537 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:35,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][116], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:35,537 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:35,538 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-04-18 15:52:35,538 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:35,538 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:35,554 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][115], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:35,554 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:35,554 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-04-18 15:52:35,554 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:35,554 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:35,568 INFO L129 PetriNetUnfolder]: 669/3770 cut-off events. [2022-04-18 15:52:35,568 INFO L130 PetriNetUnfolder]: For 1381/3918 co-relation queries the response was YES. [2022-04-18 15:52:35,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5172 conditions, 3770 events. 669/3770 cut-off events. For 1381/3918 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 37303 event pairs, 135 based on Foata normal form. 1/3046 useless extension candidates. Maximal degree in co-relation 5164. Up to 495 conditions per place. [2022-04-18 15:52:35,606 INFO L132 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-04-18 15:52:35,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-04-18 15:52:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-04-18 15:52:35,608 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-04-18 15:52:35,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-04-18 15:52:35,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-04-18 15:52:35,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:35,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-04-18 15:52:35,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 15:52:35,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:35,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:35,610 INFO L186 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-04-18 15:52:35,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-04-18 15:52:35,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:52:35,613 INFO L242 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-04-18 15:52:35,614 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2022-04-18 15:52:35,614 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-04-18 15:52:35,614 INFO L478 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-04-18 15:52:35,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 15:52:35,614 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:35,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:35,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 15:52:35,615 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1456596170, now seen corresponding path program 1 times [2022-04-18 15:52:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:35,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312124075] [2022-04-18 15:52:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:35,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312124075] [2022-04-18 15:52:35,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312124075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:35,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:35,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478746329] [2022-04-18 15:52:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:35,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:35,637 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-04-18 15:52:35,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 15:52:35,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:35,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-04-18 15:52:35,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:36,826 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 66#salethreadENTRYtrue, Black: 134#true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:36,827 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-04-18 15:52:36,827 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-04-18 15:52:36,827 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-04-18 15:52:36,828 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-04-18 15:52:36,952 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 103#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:36,952 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-04-18 15:52:36,952 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-04-18 15:52:36,952 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-04-18 15:52:36,953 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-04-18 15:52:36,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 107#L722-1true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:36,953 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-04-18 15:52:36,953 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-04-18 15:52:36,953 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-04-18 15:52:36,953 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-04-18 15:52:36,954 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0), 89#L722-2true]) [2022-04-18 15:52:36,954 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-04-18 15:52:36,954 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-04-18 15:52:36,954 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-04-18 15:52:36,954 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-04-18 15:52:36,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), 42#L722-1true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:36,955 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-04-18 15:52:36,955 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-04-18 15:52:36,955 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-04-18 15:52:36,955 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-04-18 15:52:36,974 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), 98#L721-3true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:36,975 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:36,975 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:36,975 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-04-18 15:52:36,975 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:37,125 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:37,125 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:37,126 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-04-18 15:52:37,126 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:37,126 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:37,243 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 103#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:37,244 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-04-18 15:52:37,244 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-04-18 15:52:37,244 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-04-18 15:52:37,244 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-04-18 15:52:37,244 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-04-18 15:52:37,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:37,345 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:37,346 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:37,346 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:37,346 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:37,568 INFO L129 PetriNetUnfolder]: 4591/16334 cut-off events. [2022-04-18 15:52:37,569 INFO L130 PetriNetUnfolder]: For 6286/11642 co-relation queries the response was YES. [2022-04-18 15:52:37,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27115 conditions, 16334 events. 4591/16334 cut-off events. For 6286/11642 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 199919 event pairs, 1427 based on Foata normal form. 4/13939 useless extension candidates. Maximal degree in co-relation 27106. Up to 5004 conditions per place. [2022-04-18 15:52:37,744 INFO L132 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-04-18 15:52:37,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-04-18 15:52:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-04-18 15:52:37,746 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-04-18 15:52:37,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-04-18 15:52:37,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-04-18 15:52:37,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:37,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-04-18 15:52:37,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 15:52:37,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:37,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 15:52:37,749 INFO L186 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-04-18 15:52:37,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-04-18 15:52:37,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:37,761 INFO L242 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-04-18 15:52:37,761 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=122, PETRI_TRANSITIONS=136} [2022-04-18 15:52:37,762 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-04-18 15:52:37,762 INFO L478 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-04-18 15:52:37,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 15:52:37,763 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:37,763 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:37,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 15:52:37,763 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash -505216926, now seen corresponding path program 1 times [2022-04-18 15:52:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:37,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327585981] [2022-04-18 15:52:37,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:37,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:37,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327585981] [2022-04-18 15:52:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327585981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:52:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129422341] [2022-04-18 15:52:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:52:37,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:52:37,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 15:52:37,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 15:52:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:37,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 15:52:37,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:52:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:37,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:52:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:38,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129422341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:52:38,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:52:38,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-04-18 15:52:38,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760293615] [2022-04-18 15:52:38,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:52:38,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 15:52:38,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:38,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 15:52:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-18 15:52:38,046 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-04-18 15:52:38,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 426 flow. Second operand has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 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 15:52:38,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:38,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-04-18 15:52:38,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:38,688 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, 102#L746-3true, Black: 136#(= |#race~stopSales~0| 0), 306#(< |ULTIMATE.start_main_~i~0#1| 5), 94#L721-2true, Black: 140#true, salethreadThread1of3ForFork0InUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:38,688 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-04-18 15:52:38,688 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-04-18 15:52:38,688 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-04-18 15:52:38,688 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-04-18 15:52:38,879 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [60#L746-4true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 136#(= |#race~stopSales~0| 0), 94#L721-2true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:38,879 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-04-18 15:52:38,879 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:38,880 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:38,880 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-04-18 15:52:39,049 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 136#(= |#race~stopSales~0| 0), 95#L746-5true, 94#L721-2true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:39,050 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-04-18 15:52:39,050 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-04-18 15:52:39,050 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-04-18 15:52:39,050 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-04-18 15:52:39,124 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [24#L746-6true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 136#(= |#race~stopSales~0| 0), 94#L721-2true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:39,124 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,124 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 136#(= |#race~stopSales~0| 0), 306#(< |ULTIMATE.start_main_~i~0#1| 5), 94#L721-2true, Black: 140#true, salethreadThread1of3ForFork0InUse, 11#L747true, 98#L721-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:39,125 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,125 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-04-18 15:52:39,315 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 136#(= |#race~stopSales~0| 0), 306#(< |ULTIMATE.start_main_~i~0#1| 5), 94#L721-2true, Black: 140#true, salethreadThread1of3ForFork0InUse, 98#L721-3true, 64#L747-3true, salethreadThread2of3ForFork0InUse, 126#true, salethreadThread3of3ForFork0InUse, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:39,315 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-04-18 15:52:39,316 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-04-18 15:52:39,316 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-04-18 15:52:39,316 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-04-18 15:52:39,766 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][108], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, 98#L721-3true, Black: 134#true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:39,766 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,766 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,766 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,767 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-04-18 15:52:39,767 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [146#true, Black: 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), 98#L721-3true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:39,767 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,767 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,767 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:39,767 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-04-18 15:52:40,119 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][134], [Black: 140#true, 146#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, salethreadThread1of3ForFork0InUse, 56#L752true, 103#L722-2true, Black: 134#true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:40,120 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-04-18 15:52:40,120 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-04-18 15:52:40,120 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-04-18 15:52:40,120 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-04-18 15:52:40,413 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][108], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 98#L721-3true, Black: 134#true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:40,414 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [146#true, Black: 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 136#(= |#race~stopSales~0| 0), 98#L721-3true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:40,414 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:40,414 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:40,466 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][134], [146#true, Black: 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 103#L722-2true, 56#L752true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-04-18 15:52:40,466 INFO L384 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-04-18 15:52:40,466 INFO L387 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-04-18 15:52:40,466 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-04-18 15:52:40,466 INFO L387 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-04-18 15:52:40,634 INFO L129 PetriNetUnfolder]: 6215/25019 cut-off events. [2022-04-18 15:52:40,635 INFO L130 PetriNetUnfolder]: For 10981/13796 co-relation queries the response was YES. [2022-04-18 15:52:40,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44021 conditions, 25019 events. 6215/25019 cut-off events. For 10981/13796 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 336738 event pairs, 1518 based on Foata normal form. 193/21184 useless extension candidates. Maximal degree in co-relation 44011. Up to 3637 conditions per place. [2022-04-18 15:52:40,872 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-04-18 15:52:40,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-04-18 15:52:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 15:52:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-04-18 15:52:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-04-18 15:52:40,877 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-04-18 15:52:40,877 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-04-18 15:52:40,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-04-18 15:52:40,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:40,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-04-18 15:52:40,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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 15:52:40,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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 15:52:40,883 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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 15:52:40,883 INFO L186 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-04-18 15:52:40,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-04-18 15:52:40,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:40,967 INFO L242 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-04-18 15:52:40,968 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2022-04-18 15:52:40,968 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-04-18 15:52:40,968 INFO L478 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-04-18 15:52:40,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 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 15:52:40,969 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:40,969 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:40,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 15:52:41,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-18 15:52:41,193 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:41,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1053784385, now seen corresponding path program 1 times [2022-04-18 15:52:41,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:41,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428106809] [2022-04-18 15:52:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:41,240 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 15:52:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428106809] [2022-04-18 15:52:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428106809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:41,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:41,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 15:52:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406815732] [2022-04-18 15:52:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:41,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 15:52:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 15:52:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-18 15:52:41,243 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-04-18 15:52:41,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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 15:52:41,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:41,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-04-18 15:52:41,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:42,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, 77#L722-1true, Black: 134#true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), 126#true, salethreadThread3of3ForFork0InUse]) [2022-04-18 15:52:42,547 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-04-18 15:52:42,547 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-04-18 15:52:42,547 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-04-18 15:52:42,548 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-04-18 15:52:42,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, 6#L722-2true, Black: 134#true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), 126#true, salethreadThread3of3ForFork0InUse]) [2022-04-18 15:52:42,548 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-04-18 15:52:42,548 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-04-18 15:52:42,548 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-04-18 15:52:42,548 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-04-18 15:52:42,552 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-2-->L723: Formula: (= v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1 v_~numberOfSeatsSold~0_1) InVars {~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1} OutVars{~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1, salethreadThread3of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1} AuxVars[] AssignedVars[salethreadThread3of3ForFork0_~_numberOfSeatsSold~0][136], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, 146#true, Black: 140#true, 40#L723true, 21#L728true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 126#true, salethreadThread3of3ForFork0InUse]) [2022-04-18 15:52:42,552 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-04-18 15:52:42,553 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-04-18 15:52:42,553 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-04-18 15:52:42,553 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-04-18 15:52:42,781 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 134#true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, 98#L721-3true, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:42,781 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-04-18 15:52:42,781 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:42,782 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-04-18 15:52:42,782 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-04-18 15:52:43,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L721-3true, Black: 134#true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:43,459 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-04-18 15:52:43,459 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,459 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,459 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,466 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][175], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, 146#true, Black: 140#true, 21#L728true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:43,466 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-04-18 15:52:43,466 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-04-18 15:52:43,466 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-04-18 15:52:43,467 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-04-18 15:52:43,506 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0NotInUse, 98#L721-3true, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:43,506 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,506 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-04-18 15:52:43,506 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,506 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:43,994 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:43,994 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-04-18 15:52:43,995 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 15:52:43,995 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:43,995 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 15:52:44,073 INFO L129 PetriNetUnfolder]: 7656/32031 cut-off events. [2022-04-18 15:52:44,073 INFO L130 PetriNetUnfolder]: For 7864/14713 co-relation queries the response was YES. [2022-04-18 15:52:44,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51879 conditions, 32031 events. 7656/32031 cut-off events. For 7864/14713 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 456030 event pairs, 2220 based on Foata normal form. 112/27170 useless extension candidates. Maximal degree in co-relation 51867. Up to 4766 conditions per place. [2022-04-18 15:52:44,350 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-04-18 15:52:44,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-04-18 15:52:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 15:52:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-04-18 15:52:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-18 15:52:44,353 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-04-18 15:52:44,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-04-18 15:52:44,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-04-18 15:52:44,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:44,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-04-18 15:52:44,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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 15:52:44,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 15:52:44,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 15:52:44,357 INFO L186 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-04-18 15:52:44,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-04-18 15:52:44,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 797 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-04-18 15:52:44,364 INFO L242 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-04-18 15:52:44,364 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=137, PETRI_TRANSITIONS=148} [2022-04-18 15:52:44,365 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-04-18 15:52:44,365 INFO L478 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-04-18 15:52:44,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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 15:52:44,365 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:44,366 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:44,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 15:52:44,366 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash -213244023, now seen corresponding path program 1 times [2022-04-18 15:52:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:44,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065117718] [2022-04-18 15:52:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:44,418 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 15:52:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065117718] [2022-04-18 15:52:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065117718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:44,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:44,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 15:52:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483827651] [2022-04-18 15:52:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:44,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 15:52:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 15:52:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-18 15:52:44,422 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-04-18 15:52:44,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 148 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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 15:52:44,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:44,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-04-18 15:52:44,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:46,576 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, 98#L721-3true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:46,577 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-04-18 15:52:46,577 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-04-18 15:52:46,577 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:46,577 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-04-18 15:52:47,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 5), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-04-18 15:52:47,339 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-04-18 15:52:47,339 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:47,340 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:47,340 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 15:52:47,441 INFO L129 PetriNetUnfolder]: 7497/33073 cut-off events. [2022-04-18 15:52:47,441 INFO L130 PetriNetUnfolder]: For 15899/21693 co-relation queries the response was YES. [2022-04-18 15:52:47,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58010 conditions, 33073 events. 7497/33073 cut-off events. For 15899/21693 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 479423 event pairs, 2289 based on Foata normal form. 208/28497 useless extension candidates. Maximal degree in co-relation 57994. Up to 4780 conditions per place. [2022-04-18 15:52:47,742 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-04-18 15:52:47,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-04-18 15:52:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 15:52:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-04-18 15:52:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-04-18 15:52:47,745 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-04-18 15:52:47,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-04-18 15:52:47,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-04-18 15:52:47,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:47,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-04-18 15:52:47,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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 15:52:47,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 15:52:47,749 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 15:52:47,749 INFO L186 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-04-18 15:52:47,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-04-18 15:52:47,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:52:47,775 INFO L242 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-04-18 15:52:47,776 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2022-04-18 15:52:47,777 INFO L335 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-04-18 15:52:47,777 INFO L478 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-04-18 15:52:47,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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 15:52:47,778 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:47,778 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:47,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-18 15:52:47,778 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-04-18 15:52:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1691602673, now seen corresponding path program 1 times [2022-04-18 15:52:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:47,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345554938] [2022-04-18 15:52:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:47,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:52:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:47,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:52:47,822 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:52:47,824 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-04-18 15:52:47,824 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-04-18 15:52:47,824 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-04-18 15:52:47,824 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-04-18 15:52:47,824 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-04-18 15:52:47,825 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-04-18 15:52:47,826 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-04-18 15:52:47,827 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-04-18 15:52:47,827 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-04-18 15:52:47,827 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-04-18 15:52:47,827 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-04-18 15:52:47,827 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-04-18 15:52:47,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-18 15:52:47,828 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:47,832 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-04-18 15:52:47,833 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 15:52:47,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:52:47 BasicIcfg [2022-04-18 15:52:47,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 15:52:47,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 15:52:47,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 15:52:47,914 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 15:52:47,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:31" (3/4) ... [2022-04-18 15:52:47,917 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 15:52:47,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 15:52:47,918 INFO L158 Benchmark]: Toolchain (without parser) took 17020.67ms. Allocated memory was 90.2MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 69.5MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 959.8MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,918 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:52:47,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.79ms. Allocated memory is still 90.2MB. Free memory was 69.5MB in the beginning and 56.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.20ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 54.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,919 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 90.2MB. Free memory was 54.0MB in the beginning and 52.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,919 INFO L158 Benchmark]: RCFGBuilder took 412.23ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 85.8MB in the end (delta: -33.6MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,920 INFO L158 Benchmark]: TraceAbstraction took 16059.64ms. Allocated memory was 109.1MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 85.3MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 957.0MB. Max. memory is 16.1GB. [2022-04-18 15:52:47,921 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 6.9GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:52:47,923 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.17ms. Allocated memory is still 90.2MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.79ms. Allocated memory is still 90.2MB. Free memory was 69.5MB in the beginning and 56.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.20ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 54.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 90.2MB. Free memory was 54.0MB in the beginning and 52.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.23ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 85.8MB in the end (delta: -33.6MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16059.64ms. Allocated memory was 109.1MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 85.3MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 957.0MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 6.9GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[5]; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (5 - (((5 / 10) == 0) ? 1 : (5 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 100 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 9 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=0, InterpolantAutomatonStates: 11, 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.2s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 117 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 21 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=4, InterpolantAutomatonStates: 20, 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.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 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 with 3 thread instances CFG has 5 procedures, 134 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 33 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 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 15:52:48,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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