./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c --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/weaver/popl20-channel-sum.wvr.c -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 c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:35:13,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:35:13,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:35:13,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:35:13,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:35:13,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:35:13,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:35:13,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:35:13,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:35:13,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:35:13,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:35:13,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:35:13,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:35:13,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:35:13,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:35:13,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:35:13,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:35:13,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:35:13,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:35:13,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:35:13,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:35:13,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:35:13,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:35:13,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:35:13,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:35:13,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:35:13,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:35:13,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:35:13,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:35:13,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:35:13,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:35:13,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:35:13,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:35:13,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:35:13,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:35:13,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:35:13,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:35:13,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:35:13,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:35:13,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:35:13,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:35:13,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:35:13,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 16:35:13,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:35:13,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:35:13,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:35:13,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:35:13,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:35:13,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:35:13,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:35:13,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:35:13,637 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:35:13,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:35:13,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:35:13,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:35:13,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:35:13,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:35:13,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:35:13,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:35:13,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:35:13,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:35:13,639 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:35:13,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:35:13,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:35:13,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:35:13,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:35:13,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:35:13,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:35:13,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:35:13,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:35:13,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:35:13,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:35:13,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:35:13,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:35:13,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:35:13,642 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:35:13,642 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:35:13,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:35:13,643 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 -> c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c [2022-04-18 16:35:13,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:35:13,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:35:13,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:35:13,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:35:13,893 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:35:13,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-04-18 16:35:13,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc321805/c9c66559878c49b9a17dfdbbdf74412e/FLAG579ebaeba [2022-04-18 16:35:14,317 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:35:14,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-04-18 16:35:14,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc321805/c9c66559878c49b9a17dfdbbdf74412e/FLAG579ebaeba [2022-04-18 16:35:14,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc321805/c9c66559878c49b9a17dfdbbdf74412e [2022-04-18 16:35:14,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:35:14,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:35:14,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:35:14,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:35:14,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:35:14,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:14,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114e3ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14, skipping insertion in model container [2022-04-18 16:35:14,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:14,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:35:14,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:35:14,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-04-18 16:35:14,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:35:14,927 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:35:14,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-04-18 16:35:14,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:35:14,970 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:35:14,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14 WrapperNode [2022-04-18 16:35:14,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:35:14,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:35:14,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:35:14,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:35:14,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:14,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,023 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 281 [2022-04-18 16:35:15,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:35:15,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:35:15,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:35:15,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:35:15,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:35:15,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:35:15,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:35:15,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:35:15,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (1/1) ... [2022-04-18 16:35:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:35:15,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:35:15,101 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 16:35:15,108 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 16:35:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:35:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:35:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:35:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:35:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:35:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:35:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:35:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:35:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 16:35:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 16:35:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 16:35:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:35:15,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:35:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:35:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:35:15,149 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 16:35:15,224 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:35:15,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:35:15,634 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:35:15,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:35:15,790 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-18 16:35:15,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:15 BoogieIcfgContainer [2022-04-18 16:35:15,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:35:15,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:35:15,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:35:15,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:35:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:35:14" (1/3) ... [2022-04-18 16:35:15,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb16d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:35:15, skipping insertion in model container [2022-04-18 16:35:15,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:14" (2/3) ... [2022-04-18 16:35:15,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb16d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:35:15, skipping insertion in model container [2022-04-18 16:35:15,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:15" (3/3) ... [2022-04-18 16:35:15,804 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-04-18 16:35:15,809 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:35:15,809 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:35:15,809 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-04-18 16:35:15,809 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:35:15,908 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-04-18 16:35:15,960 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:35:15,968 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 16:35:15,968 INFO L341 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-04-18 16:35:15,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 259 places, 265 transitions, 546 flow [2022-04-18 16:35:16,085 INFO L129 PetriNetUnfolder]: 13/263 cut-off events. [2022-04-18 16:35:16,087 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-04-18 16:35:16,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 263 events. 13/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 422 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-04-18 16:35:16,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 265 transitions, 546 flow [2022-04-18 16:35:16,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 242 transitions, 496 flow [2022-04-18 16:35:16,113 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2022-04-18 16:35:16,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:35:16,115 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:16,116 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] [2022-04-18 16:35:16,116 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1386209113, now seen corresponding path program 1 times [2022-04-18 16:35:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:16,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275635798] [2022-04-18 16:35:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:16,273 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 16:35:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:16,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275635798] [2022-04-18 16:35:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275635798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:16,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:16,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716541348] [2022-04-18 16:35:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:16,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:16,312 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 265 [2022-04-18 16:35:16,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 242 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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 16:35:16,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:16,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 265 [2022-04-18 16:35:16,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:16,525 INFO L129 PetriNetUnfolder]: 133/756 cut-off events. [2022-04-18 16:35:16,525 INFO L130 PetriNetUnfolder]: For 39/76 co-relation queries the response was YES. [2022-04-18 16:35:16,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 756 events. 133/756 cut-off events. For 39/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3777 event pairs, 84 based on Foata normal form. 48/679 useless extension candidates. Maximal degree in co-relation 850. Up to 241 conditions per place. [2022-04-18 16:35:16,535 INFO L132 encePairwiseOnDemand]: 239/265 looper letters, 32 selfloop transitions, 2 changer transitions 2/218 dead transitions. [2022-04-18 16:35:16,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 218 transitions, 516 flow [2022-04-18 16:35:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2022-04-18 16:35:16,552 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8465408805031447 [2022-04-18 16:35:16,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2022-04-18 16:35:16,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2022-04-18 16:35:16,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:16,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2022-04-18 16:35:16,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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 16:35:16,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:16,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:16,573 INFO L186 Difference]: Start difference. First operand has 238 places, 242 transitions, 496 flow. Second operand 3 states and 673 transitions. [2022-04-18 16:35:16,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 218 transitions, 516 flow [2022-04-18 16:35:16,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:35:16,583 INFO L242 Difference]: Finished difference. Result has 218 places, 216 transitions, 440 flow [2022-04-18 16:35:16,585 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2022-04-18 16:35:16,590 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -20 predicate places. [2022-04-18 16:35:16,590 INFO L478 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 440 flow [2022-04-18 16:35:16,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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 16:35:16,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:16,591 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 16:35:16,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:35:16,592 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 934886058, now seen corresponding path program 1 times [2022-04-18 16:35:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:16,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228703648] [2022-04-18 16:35:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:16,659 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 16:35:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:16,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228703648] [2022-04-18 16:35:16,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228703648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:16,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:16,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704557583] [2022-04-18 16:35:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:16,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:16,668 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 265 [2022-04-18 16:35:16,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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 16:35:16,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:16,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 265 [2022-04-18 16:35:16,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:16,824 INFO L129 PetriNetUnfolder]: 105/687 cut-off events. [2022-04-18 16:35:16,825 INFO L130 PetriNetUnfolder]: For 8/39 co-relation queries the response was YES. [2022-04-18 16:35:16,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 687 events. 105/687 cut-off events. For 8/39 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3268 event pairs, 49 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 858. Up to 145 conditions per place. [2022-04-18 16:35:16,829 INFO L132 encePairwiseOnDemand]: 257/265 looper letters, 29 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2022-04-18 16:35:16,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 217 transitions, 507 flow [2022-04-18 16:35:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-04-18 16:35:16,832 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8314465408805032 [2022-04-18 16:35:16,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-04-18 16:35:16,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-04-18 16:35:16,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:16,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-04-18 16:35:16,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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 16:35:16,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:16,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:16,837 INFO L186 Difference]: Start difference. First operand has 218 places, 216 transitions, 440 flow. Second operand 3 states and 661 transitions. [2022-04-18 16:35:16,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 217 transitions, 507 flow [2022-04-18 16:35:16,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:16,846 INFO L242 Difference]: Finished difference. Result has 211 places, 211 transitions, 432 flow [2022-04-18 16:35:16,847 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2022-04-18 16:35:16,848 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -27 predicate places. [2022-04-18 16:35:16,848 INFO L478 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 432 flow [2022-04-18 16:35:16,849 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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 16:35:16,849 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:16,849 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] [2022-04-18 16:35:16,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:35:16,849 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -283225401, now seen corresponding path program 1 times [2022-04-18 16:35:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252401277] [2022-04-18 16:35:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:16,902 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 16:35:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:16,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252401277] [2022-04-18 16:35:16,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252401277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:16,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228779678] [2022-04-18 16:35:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:16,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:16,908 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-04-18 16:35:16,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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 16:35:16,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:16,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-04-18 16:35:16,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:16,995 INFO L129 PetriNetUnfolder]: 28/532 cut-off events. [2022-04-18 16:35:16,996 INFO L130 PetriNetUnfolder]: For 13/32 co-relation queries the response was YES. [2022-04-18 16:35:16,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 532 events. 28/532 cut-off events. For 13/32 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2197 event pairs, 9 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 453. Up to 43 conditions per place. [2022-04-18 16:35:17,001 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 14 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2022-04-18 16:35:17,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 462 flow [2022-04-18 16:35:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-04-18 16:35:17,005 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8628930817610063 [2022-04-18 16:35:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-04-18 16:35:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-04-18 16:35:17,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:17,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-04-18 16:35:17,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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 16:35:17,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,010 INFO L186 Difference]: Start difference. First operand has 211 places, 211 transitions, 432 flow. Second operand 3 states and 686 transitions. [2022-04-18 16:35:17,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 462 flow [2022-04-18 16:35:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:17,014 INFO L242 Difference]: Finished difference. Result has 210 places, 210 transitions, 428 flow [2022-04-18 16:35:17,015 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2022-04-18 16:35:17,017 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-04-18 16:35:17,017 INFO L478 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 428 flow [2022-04-18 16:35:17,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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 16:35:17,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:17,018 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] [2022-04-18 16:35:17,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:35:17,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1096917963, now seen corresponding path program 1 times [2022-04-18 16:35:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:17,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500447900] [2022-04-18 16:35:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:17,082 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 16:35:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500447900] [2022-04-18 16:35:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500447900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285427646] [2022-04-18 16:35:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:17,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:17,093 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-04-18 16:35:17,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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 16:35:17,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:17,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-04-18 16:35:17,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:17,182 INFO L129 PetriNetUnfolder]: 49/576 cut-off events. [2022-04-18 16:35:17,182 INFO L130 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-04-18 16:35:17,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 576 events. 49/576 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2511 event pairs, 24 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 633. Up to 85 conditions per place. [2022-04-18 16:35:17,188 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-04-18 16:35:17,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 470 flow [2022-04-18 16:35:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2022-04-18 16:35:17,190 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8477987421383648 [2022-04-18 16:35:17,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2022-04-18 16:35:17,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2022-04-18 16:35:17,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:17,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2022-04-18 16:35:17,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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 16:35:17,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,198 INFO L186 Difference]: Start difference. First operand has 210 places, 210 transitions, 428 flow. Second operand 3 states and 674 transitions. [2022-04-18 16:35:17,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 470 flow [2022-04-18 16:35:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:17,204 INFO L242 Difference]: Finished difference. Result has 209 places, 209 transitions, 426 flow [2022-04-18 16:35:17,204 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2022-04-18 16:35:17,206 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-04-18 16:35:17,206 INFO L478 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 426 flow [2022-04-18 16:35:17,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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 16:35:17,207 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:17,207 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 16:35:17,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:35:17,207 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1375121806, now seen corresponding path program 1 times [2022-04-18 16:35:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849916947] [2022-04-18 16:35:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:17,265 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 16:35:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849916947] [2022-04-18 16:35:17,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849916947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:17,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:17,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977137165] [2022-04-18 16:35:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:17,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:17,269 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-04-18 16:35:17,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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 16:35:17,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:17,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-04-18 16:35:17,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:17,360 INFO L129 PetriNetUnfolder]: 42/555 cut-off events. [2022-04-18 16:35:17,360 INFO L130 PetriNetUnfolder]: For 8/27 co-relation queries the response was YES. [2022-04-18 16:35:17,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 555 events. 42/555 cut-off events. For 8/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2383 event pairs, 19 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-04-18 16:35:17,365 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 16 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2022-04-18 16:35:17,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 456 flow [2022-04-18 16:35:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-04-18 16:35:17,367 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-04-18 16:35:17,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-04-18 16:35:17,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-04-18 16:35:17,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:17,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-04-18 16:35:17,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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 16:35:17,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,372 INFO L186 Difference]: Start difference. First operand has 209 places, 209 transitions, 426 flow. Second operand 3 states and 679 transitions. [2022-04-18 16:35:17,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 456 flow [2022-04-18 16:35:17,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:17,377 INFO L242 Difference]: Finished difference. Result has 207 places, 207 transitions, 420 flow [2022-04-18 16:35:17,377 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2022-04-18 16:35:17,379 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-04-18 16:35:17,379 INFO L478 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 420 flow [2022-04-18 16:35:17,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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 16:35:17,380 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:17,380 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, 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 16:35:17,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:35:17,381 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1573740915, now seen corresponding path program 1 times [2022-04-18 16:35:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234653600] [2022-04-18 16:35:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:17,449 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 16:35:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:17,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234653600] [2022-04-18 16:35:17,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234653600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:17,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:17,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630231022] [2022-04-18 16:35:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:17,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:17,454 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-04-18 16:35:17,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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 16:35:17,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:17,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-04-18 16:35:17,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:17,541 INFO L129 PetriNetUnfolder]: 49/593 cut-off events. [2022-04-18 16:35:17,541 INFO L130 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-04-18 16:35:17,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 593 events. 49/593 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2620 event pairs, 24 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 639. Up to 82 conditions per place. [2022-04-18 16:35:17,545 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 17 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2022-04-18 16:35:17,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 456 flow [2022-04-18 16:35:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2022-04-18 16:35:17,548 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8553459119496856 [2022-04-18 16:35:17,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2022-04-18 16:35:17,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2022-04-18 16:35:17,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:17,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2022-04-18 16:35:17,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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 16:35:17,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:17,552 INFO L186 Difference]: Start difference. First operand has 207 places, 207 transitions, 420 flow. Second operand 3 states and 680 transitions. [2022-04-18 16:35:17,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 456 flow [2022-04-18 16:35:17,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:35:17,556 INFO L242 Difference]: Finished difference. Result has 207 places, 206 transitions, 421 flow [2022-04-18 16:35:17,557 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=207, PETRI_TRANSITIONS=206} [2022-04-18 16:35:17,558 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-04-18 16:35:17,558 INFO L478 AbstractCegarLoop]: Abstraction has has 207 places, 206 transitions, 421 flow [2022-04-18 16:35:17,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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 16:35:17,558 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:17,559 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, 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 16:35:17,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:35:17,559 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1222548057, now seen corresponding path program 1 times [2022-04-18 16:35:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:17,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876318982] [2022-04-18 16:35:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:17,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:17,673 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 16:35:17,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:17,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876318982] [2022-04-18 16:35:17,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876318982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:17,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:17,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:35:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093108605] [2022-04-18 16:35:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:17,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:35:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:35:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:35:17,678 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 265 [2022-04-18 16:35:17,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 206 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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 16:35:17,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:17,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 265 [2022-04-18 16:35:17,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:18,057 INFO L129 PetriNetUnfolder]: 635/2367 cut-off events. [2022-04-18 16:35:18,057 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:35:18,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 2367 events. 635/2367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 16924 event pairs, 465 based on Foata normal form. 0/2014 useless extension candidates. Maximal degree in co-relation 3303. Up to 963 conditions per place. [2022-04-18 16:35:18,074 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 40 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2022-04-18 16:35:18,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 509 flow [2022-04-18 16:35:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:35:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:35:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2022-04-18 16:35:18,078 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7610062893081762 [2022-04-18 16:35:18,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2022-04-18 16:35:18,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2022-04-18 16:35:18,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:18,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2022-04-18 16:35:18,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 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 16:35:18,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:18,084 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:18,084 INFO L186 Difference]: Start difference. First operand has 207 places, 206 transitions, 421 flow. Second operand 6 states and 1210 transitions. [2022-04-18 16:35:18,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 509 flow [2022-04-18 16:35:18,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:18,089 INFO L242 Difference]: Finished difference. Result has 209 places, 205 transitions, 425 flow [2022-04-18 16:35:18,089 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2022-04-18 16:35:18,090 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-04-18 16:35:18,090 INFO L478 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 425 flow [2022-04-18 16:35:18,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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 16:35:18,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:18,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, 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, 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 16:35:18,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:35:18,091 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1280849672, now seen corresponding path program 1 times [2022-04-18 16:35:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:18,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871150390] [2022-04-18 16:35:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:18,208 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 16:35:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871150390] [2022-04-18 16:35:18,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871150390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:18,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:18,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:35:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507375624] [2022-04-18 16:35:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:18,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:35:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:18,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:35:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:35:18,212 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-04-18 16:35:18,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 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 16:35:18,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:18,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-04-18 16:35:18,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:18,628 INFO L129 PetriNetUnfolder]: 635/1599 cut-off events. [2022-04-18 16:35:18,628 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 16:35:18,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1599 events. 635/1599 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8863 event pairs, 102 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 2553. Up to 335 conditions per place. [2022-04-18 16:35:18,639 INFO L132 encePairwiseOnDemand]: 260/265 looper letters, 85 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-04-18 16:35:18,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 256 transitions, 705 flow [2022-04-18 16:35:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:35:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:35:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2022-04-18 16:35:18,643 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8075471698113208 [2022-04-18 16:35:18,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1284 transitions. [2022-04-18 16:35:18,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1284 transitions. [2022-04-18 16:35:18,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:18,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1284 transitions. [2022-04-18 16:35:18,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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 16:35:18,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:18,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:18,651 INFO L186 Difference]: Start difference. First operand has 209 places, 205 transitions, 425 flow. Second operand 6 states and 1284 transitions. [2022-04-18 16:35:18,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 256 transitions, 705 flow [2022-04-18 16:35:18,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 256 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:35:18,656 INFO L242 Difference]: Finished difference. Result has 208 places, 204 transitions, 421 flow [2022-04-18 16:35:18,657 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2022-04-18 16:35:18,659 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -30 predicate places. [2022-04-18 16:35:18,659 INFO L478 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 421 flow [2022-04-18 16:35:18,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 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 16:35:18,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:18,660 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, 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, 1, 1, 1, 1] [2022-04-18 16:35:18,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:35:18,660 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1955881516, now seen corresponding path program 1 times [2022-04-18 16:35:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197915372] [2022-04-18 16:35:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:18,717 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 16:35:18,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:18,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197915372] [2022-04-18 16:35:18,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197915372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:18,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:18,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:18,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983010453] [2022-04-18 16:35:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:18,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:18,721 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-04-18 16:35:18,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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 16:35:18,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:18,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-04-18 16:35:18,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:18,807 INFO L129 PetriNetUnfolder]: 51/623 cut-off events. [2022-04-18 16:35:18,808 INFO L130 PetriNetUnfolder]: For 10/27 co-relation queries the response was YES. [2022-04-18 16:35:18,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 623 events. 51/623 cut-off events. For 10/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2715 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 675. Up to 70 conditions per place. [2022-04-18 16:35:18,812 INFO L132 encePairwiseOnDemand]: 261/265 looper letters, 20 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2022-04-18 16:35:18,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 484 flow [2022-04-18 16:35:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2022-04-18 16:35:18,815 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8716981132075472 [2022-04-18 16:35:18,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 693 transitions. [2022-04-18 16:35:18,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 693 transitions. [2022-04-18 16:35:18,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:18,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 693 transitions. [2022-04-18 16:35:18,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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 16:35:18,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:18,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:18,819 INFO L186 Difference]: Start difference. First operand has 208 places, 204 transitions, 421 flow. Second operand 3 states and 693 transitions. [2022-04-18 16:35:18,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 484 flow [2022-04-18 16:35:18,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:35:18,824 INFO L242 Difference]: Finished difference. Result has 206 places, 206 transitions, 433 flow [2022-04-18 16:35:18,824 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=206} [2022-04-18 16:35:18,825 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-04-18 16:35:18,825 INFO L478 AbstractCegarLoop]: Abstraction has has 206 places, 206 transitions, 433 flow [2022-04-18 16:35:18,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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 16:35:18,825 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:18,826 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:35:18,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:35:18,826 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1872926674, now seen corresponding path program 1 times [2022-04-18 16:35:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:18,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959412861] [2022-04-18 16:35:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:18,931 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 16:35:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959412861] [2022-04-18 16:35:18,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959412861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:18,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:18,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:35:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103008393] [2022-04-18 16:35:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:18,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:35:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:35:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:35:18,936 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 265 [2022-04-18 16:35:18,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 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 16:35:18,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:18,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 265 [2022-04-18 16:35:18,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:19,313 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 233#L68true, 103#L52-5true, 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 305#true]) [2022-04-18 16:35:19,314 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,314 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 16:35:19,314 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,314 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,316 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 200#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 173#L52-1true, 305#true]) [2022-04-18 16:35:19,316 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,316 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-04-18 16:35:19,317 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 16:35:19,317 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,317 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (- 1) (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1)) 1 0)) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 173#L52-1true, 239#L79true, 305#true]) [2022-04-18 16:35:19,317 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,317 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,318 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 16:35:19,318 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-04-18 16:35:19,318 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 297#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 233#L68true, 103#L52-5true, 280#(= |#race~n~0| 0), 305#true]) [2022-04-18 16:35:19,318 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,318 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,319 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 16:35:19,319 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,359 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 297#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 200#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-04-18 16:35:19,360 INFO L384 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,360 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 16:35:19,360 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,360 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-04-18 16:35:19,361 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (- 1) (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1)) 1 0)) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 297#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 173#L52-1true, 239#L79true, 305#true]) [2022-04-18 16:35:19,361 INFO L384 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,361 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-04-18 16:35:19,361 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,361 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 16:35:19,362 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (- 1) (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1)) 1 0)) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 56#L101-5true, 280#(= |#race~n~0| 0), 173#L52-1true, 239#L79true, 305#true]) [2022-04-18 16:35:19,362 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,362 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,362 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 16:35:19,362 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 233#L68true, 103#L52-5true, 56#L101-5true, 280#(= |#race~n~0| 0), 305#true]) [2022-04-18 16:35:19,363 INFO L384 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-04-18 16:35:19,363 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 16:35:19,363 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-04-18 16:35:19,363 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,364 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 200#L72true, 302#(= |#race~queue~0| 0), 56#L101-5true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-04-18 16:35:19,364 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,364 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-04-18 16:35:19,364 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 16:35:19,364 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 16:35:19,371 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (- 1) (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1)) 1 0)) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 257#L101-6true, 280#(= |#race~n~0| 0), 173#L52-1true, 239#L79true, 305#true]) [2022-04-18 16:35:19,371 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,371 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,371 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,371 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 16:35:19,372 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 233#L68true, 257#L101-6true, 103#L52-5true, 280#(= |#race~n~0| 0), 305#true]) [2022-04-18 16:35:19,372 INFO L384 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-04-18 16:35:19,372 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 16:35:19,372 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-04-18 16:35:19,372 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,373 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 200#L72true, 302#(= |#race~queue~0| 0), 257#L101-6true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-04-18 16:35:19,373 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,373 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-04-18 16:35:19,373 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-04-18 16:35:19,373 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 16:35:19,481 INFO L129 PetriNetUnfolder]: 990/2976 cut-off events. [2022-04-18 16:35:19,481 INFO L130 PetriNetUnfolder]: For 263/287 co-relation queries the response was YES. [2022-04-18 16:35:19,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4877 conditions, 2976 events. 990/2976 cut-off events. For 263/287 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 20752 event pairs, 335 based on Foata normal form. 0/2631 useless extension candidates. Maximal degree in co-relation 4827. Up to 910 conditions per place. [2022-04-18 16:35:19,499 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 83 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2022-04-18 16:35:19,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 719 flow [2022-04-18 16:35:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:35:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:35:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-04-18 16:35:19,503 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7905660377358491 [2022-04-18 16:35:19,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-04-18 16:35:19,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-04-18 16:35:19,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:19,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-04-18 16:35:19,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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 16:35:19,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:19,509 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:19,509 INFO L186 Difference]: Start difference. First operand has 206 places, 206 transitions, 433 flow. Second operand 6 states and 1257 transitions. [2022-04-18 16:35:19,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 719 flow [2022-04-18 16:35:19,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 249 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:35:19,514 INFO L242 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2022-04-18 16:35:19,514 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-04-18 16:35:19,515 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-04-18 16:35:19,515 INFO L478 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2022-04-18 16:35:19,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 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 16:35:19,516 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:19,516 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:35:19,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:35:19,517 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1918516166, now seen corresponding path program 1 times [2022-04-18 16:35:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:19,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273139653] [2022-04-18 16:35:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:19,653 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 16:35:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273139653] [2022-04-18 16:35:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273139653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:35:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969664168] [2022-04-18 16:35:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:19,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:35:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:35:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:35:19,657 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-04-18 16:35:19,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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 16:35:19,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:19,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-04-18 16:35:19,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,028 INFO L129 PetriNetUnfolder]: 625/2401 cut-off events. [2022-04-18 16:35:20,029 INFO L130 PetriNetUnfolder]: For 263/403 co-relation queries the response was YES. [2022-04-18 16:35:20,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2401 events. 625/2401 cut-off events. For 263/403 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 17018 event pairs, 315 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 3755. Up to 851 conditions per place. [2022-04-18 16:35:20,049 INFO L132 encePairwiseOnDemand]: 260/265 looper letters, 61 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2022-04-18 16:35:20,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 232 transitions, 665 flow [2022-04-18 16:35:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:35:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:35:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2022-04-18 16:35:20,053 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7861635220125787 [2022-04-18 16:35:20,053 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1250 transitions. [2022-04-18 16:35:20,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1250 transitions. [2022-04-18 16:35:20,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1250 transitions. [2022-04-18 16:35:20,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.33333333333334) internal successors, (1250), 6 states have internal predecessors, (1250), 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 16:35:20,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:20,061 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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 16:35:20,061 INFO L186 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 6 states and 1250 transitions. [2022-04-18 16:35:20,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 232 transitions, 665 flow [2022-04-18 16:35:20,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 232 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:35:20,069 INFO L242 Difference]: Finished difference. Result has 209 places, 204 transitions, 437 flow [2022-04-18 16:35:20,069 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-04-18 16:35:20,070 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-04-18 16:35:20,070 INFO L478 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 437 flow [2022-04-18 16:35:20,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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 16:35:20,071 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:20,071 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:35:20,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:35:20,072 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 731875413, now seen corresponding path program 1 times [2022-04-18 16:35:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:20,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488906619] [2022-04-18 16:35:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:20,119 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 16:35:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488906619] [2022-04-18 16:35:20,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488906619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:20,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:20,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253271570] [2022-04-18 16:35:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:20,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:20,124 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-04-18 16:35:20,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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 16:35:20,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:20,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-04-18 16:35:20,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,219 INFO L129 PetriNetUnfolder]: 92/678 cut-off events. [2022-04-18 16:35:20,220 INFO L130 PetriNetUnfolder]: For 40/64 co-relation queries the response was YES. [2022-04-18 16:35:20,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 678 events. 92/678 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3069 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 863. Up to 124 conditions per place. [2022-04-18 16:35:20,224 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 24 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-04-18 16:35:20,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 504 flow [2022-04-18 16:35:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2022-04-18 16:35:20,227 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8654088050314466 [2022-04-18 16:35:20,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2022-04-18 16:35:20,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2022-04-18 16:35:20,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2022-04-18 16:35:20,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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 16:35:20,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,231 INFO L186 Difference]: Start difference. First operand has 209 places, 204 transitions, 437 flow. Second operand 3 states and 688 transitions. [2022-04-18 16:35:20,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 504 flow [2022-04-18 16:35:20,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:35:20,237 INFO L242 Difference]: Finished difference. Result has 206 places, 203 transitions, 432 flow [2022-04-18 16:35:20,237 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2022-04-18 16:35:20,238 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-04-18 16:35:20,238 INFO L478 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 432 flow [2022-04-18 16:35:20,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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 16:35:20,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:20,239 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, 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, 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 16:35:20,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:35:20,239 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash -113345370, now seen corresponding path program 1 times [2022-04-18 16:35:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:20,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263436661] [2022-04-18 16:35:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:20,288 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 16:35:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:20,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263436661] [2022-04-18 16:35:20,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263436661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:20,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:20,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801060098] [2022-04-18 16:35:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:20,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:20,292 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-04-18 16:35:20,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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 16:35:20,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:20,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-04-18 16:35:20,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,412 INFO L129 PetriNetUnfolder]: 78/639 cut-off events. [2022-04-18 16:35:20,412 INFO L130 PetriNetUnfolder]: For 36/60 co-relation queries the response was YES. [2022-04-18 16:35:20,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 639 events. 78/639 cut-off events. For 36/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2763 event pairs, 21 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 793. Up to 97 conditions per place. [2022-04-18 16:35:20,415 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 20 selfloop transitions, 2 changer transitions 15/206 dead transitions. [2022-04-18 16:35:20,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 497 flow [2022-04-18 16:35:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-04-18 16:35:20,417 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-04-18 16:35:20,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-04-18 16:35:20,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-04-18 16:35:20,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-04-18 16:35:20,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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 16:35:20,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,433 INFO L186 Difference]: Start difference. First operand has 206 places, 203 transitions, 432 flow. Second operand 3 states and 679 transitions. [2022-04-18 16:35:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 497 flow [2022-04-18 16:35:20,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:20,438 INFO L242 Difference]: Finished difference. Result has 203 places, 185 transitions, 393 flow [2022-04-18 16:35:20,438 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=203, PETRI_TRANSITIONS=185} [2022-04-18 16:35:20,439 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2022-04-18 16:35:20,439 INFO L478 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 393 flow [2022-04-18 16:35:20,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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 16:35:20,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:20,440 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, 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, 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 16:35:20,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:35:20,440 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -303010293, now seen corresponding path program 1 times [2022-04-18 16:35:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:20,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950976557] [2022-04-18 16:35:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:20,482 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 16:35:20,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:20,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950976557] [2022-04-18 16:35:20,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950976557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:20,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:20,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034577429] [2022-04-18 16:35:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:20,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:20,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:20,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:20,486 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 265 [2022-04-18 16:35:20,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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 16:35:20,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:20,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 265 [2022-04-18 16:35:20,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,575 INFO L129 PetriNetUnfolder]: 133/691 cut-off events. [2022-04-18 16:35:20,575 INFO L130 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-04-18 16:35:20,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 691 events. 133/691 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3030 event pairs, 53 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 971. Up to 202 conditions per place. [2022-04-18 16:35:20,579 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-04-18 16:35:20,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 474 flow [2022-04-18 16:35:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2022-04-18 16:35:20,581 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2022-04-18 16:35:20,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2022-04-18 16:35:20,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2022-04-18 16:35:20,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2022-04-18 16:35:20,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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 16:35:20,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,585 INFO L186 Difference]: Start difference. First operand has 203 places, 185 transitions, 393 flow. Second operand 3 states and 650 transitions. [2022-04-18 16:35:20,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 474 flow [2022-04-18 16:35:20,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:20,588 INFO L242 Difference]: Finished difference. Result has 186 places, 184 transitions, 391 flow [2022-04-18 16:35:20,588 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-04-18 16:35:20,589 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-04-18 16:35:20,589 INFO L478 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 391 flow [2022-04-18 16:35:20,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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 16:35:20,590 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:20,592 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, 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, 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 16:35:20,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:35:20,592 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -345096208, now seen corresponding path program 1 times [2022-04-18 16:35:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761362292] [2022-04-18 16:35:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:20,627 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 16:35:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:20,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761362292] [2022-04-18 16:35:20,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761362292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:20,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:20,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939348385] [2022-04-18 16:35:20,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:20,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:20,631 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-04-18 16:35:20,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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 16:35:20,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:20,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-04-18 16:35:20,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,716 INFO L129 PetriNetUnfolder]: 72/730 cut-off events. [2022-04-18 16:35:20,716 INFO L130 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2022-04-18 16:35:20,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 730 events. 72/730 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3012 event pairs, 12 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 855. Up to 64 conditions per place. [2022-04-18 16:35:20,722 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-04-18 16:35:20,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 452 flow [2022-04-18 16:35:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2022-04-18 16:35:20,724 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2022-04-18 16:35:20,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 690 transitions. [2022-04-18 16:35:20,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions. [2022-04-18 16:35:20,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions. [2022-04-18 16:35:20,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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 16:35:20,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,728 INFO L186 Difference]: Start difference. First operand has 186 places, 184 transitions, 391 flow. Second operand 3 states and 690 transitions. [2022-04-18 16:35:20,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 452 flow [2022-04-18 16:35:20,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:20,731 INFO L242 Difference]: Finished difference. Result has 186 places, 184 transitions, 395 flow [2022-04-18 16:35:20,732 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-04-18 16:35:20,732 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-04-18 16:35:20,732 INFO L478 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 395 flow [2022-04-18 16:35:20,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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 16:35:20,733 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:20,733 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, 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, 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 16:35:20,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:35:20,733 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-04-18 16:35:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 185153395, now seen corresponding path program 1 times [2022-04-18 16:35:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:20,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776524225] [2022-04-18 16:35:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:20,772 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 16:35:20,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776524225] [2022-04-18 16:35:20,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776524225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:20,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:20,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755286889] [2022-04-18 16:35:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:20,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:20,777 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 265 [2022-04-18 16:35:20,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 16:35:20,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:20,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 265 [2022-04-18 16:35:20,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:20,881 INFO L129 PetriNetUnfolder]: 86/738 cut-off events. [2022-04-18 16:35:20,881 INFO L130 PetriNetUnfolder]: For 34/38 co-relation queries the response was YES. [2022-04-18 16:35:20,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 738 events. 86/738 cut-off events. For 34/38 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2940 event pairs, 21 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 901. Up to 100 conditions per place. [2022-04-18 16:35:20,885 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 0 selfloop transitions, 0 changer transitions 189/189 dead transitions. [2022-04-18 16:35:20,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 456 flow [2022-04-18 16:35:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-04-18 16:35:20,888 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8389937106918239 [2022-04-18 16:35:20,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-04-18 16:35:20,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-04-18 16:35:20,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:20,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-04-18 16:35:20,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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 16:35:20,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 16:35:20,892 INFO L186 Difference]: Start difference. First operand has 186 places, 184 transitions, 395 flow. Second operand 3 states and 667 transitions. [2022-04-18 16:35:20,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 456 flow [2022-04-18 16:35:20,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:35:20,895 INFO L242 Difference]: Finished difference. Result has 186 places, 0 transitions, 0 flow [2022-04-18 16:35:20,896 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=186, PETRI_TRANSITIONS=0} [2022-04-18 16:35:20,896 INFO L335 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-04-18 16:35:20,897 INFO L478 AbstractCegarLoop]: Abstraction has has 186 places, 0 transitions, 0 flow [2022-04-18 16:35:20,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 16:35:20,901 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2022-04-18 16:35:20,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2022-04-18 16:35:20,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2022-04-18 16:35:20,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2022-04-18 16:35:20,905 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2022-04-18 16:35:20,906 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2022-04-18 16:35:20,907 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2022-04-18 16:35:20,908 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2022-04-18 16:35:20,909 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2022-04-18 16:35:20,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2022-04-18 16:35:20,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2022-04-18 16:35:20,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2022-04-18 16:35:20,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2022-04-18 16:35:20,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2022-04-18 16:35:20,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2022-04-18 16:35:20,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2022-04-18 16:35:20,913 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2022-04-18 16:35:20,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:35:20,916 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:35:20,921 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 16:35:20,921 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 16:35:20,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:35:20 BasicIcfg [2022-04-18 16:35:20,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 16:35:20,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 16:35:20,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 16:35:20,925 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 16:35:20,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:15" (3/4) ... [2022-04-18 16:35:20,928 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-04-18 16:35:20,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-04-18 16:35:20,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-04-18 16:35:20,937 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-04-18 16:35:20,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-04-18 16:35:20,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-04-18 16:35:20,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-04-18 16:35:20,979 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-04-18 16:35:20,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 16:35:20,980 INFO L158 Benchmark]: Toolchain (without parser) took 6240.70ms. Allocated memory was 92.3MB in the beginning and 350.2MB in the end (delta: 257.9MB). Free memory was 59.3MB in the beginning and 220.6MB in the end (delta: -161.2MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,980 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 16:35:20,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.19ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 59.1MB in the beginning and 91.1MB in the end (delta: -32.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.12ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 88.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,981 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,981 INFO L158 Benchmark]: RCFGBuilder took 720.80ms. Allocated memory is still 117.4MB. Free memory was 86.4MB in the beginning and 53.4MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,982 INFO L158 Benchmark]: TraceAbstraction took 5128.69ms. Allocated memory was 117.4MB in the beginning and 350.2MB in the end (delta: 232.8MB). Free memory was 52.9MB in the beginning and 224.8MB in the end (delta: -171.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,982 INFO L158 Benchmark]: Witness Printer took 54.33ms. Allocated memory is still 350.2MB. Free memory was 224.8MB in the beginning and 220.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:35:20,984 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.16ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.19ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 59.1MB in the beginning and 91.1MB in the end (delta: -32.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.12ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 88.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.80ms. Allocated memory is still 117.4MB. Free memory was 86.4MB in the beginning and 53.4MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5128.69ms. Allocated memory was 117.4MB in the beginning and 350.2MB in the end (delta: 232.8MB). Free memory was 52.9MB in the beginning and 224.8MB in the end (delta: -171.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 54.33ms. Allocated memory is still 350.2MB. Free memory was 224.8MB in the beginning and 220.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 355 locations, 71 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: 5.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 189 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-18 16:35:21,022 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 Result: TRUE