./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/sigma.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/sigma.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8 --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 236a73c15e935747b9f2e95e881c26c921eba2f2ad7a2b23cf05552665b9f683 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:58:25,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:58:25,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:58:25,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:58:25,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:58:25,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:58:25,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:58:25,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:58:25,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:58:25,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:58:25,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:58:25,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:58:25,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:58:25,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:58:25,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:58:25,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:58:25,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:58:25,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:58:25,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:58:25,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:58:25,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:58:25,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:58:25,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:58:25,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:58:25,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:58:25,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:58:25,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:58:25,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:58:25,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:58:25,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:58:25,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:58:25,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:58:25,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:58:25,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:58:25,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:58:25,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:58:25,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:58:25,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:58:25,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:58:25,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:58:25,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:58:25,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 10:58:25,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:58:25,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:58:25,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:58:25,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:58:25,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:58:25,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:58:25,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:58:25,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:58:25,678 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:58:25,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:58:25,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:58:25,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:58:25,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:58:25,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:58:25,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:58:25,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:58:25,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:58:25,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:58:25,681 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 10:58:25,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:58:25,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:58:25,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:58:25,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:58:25,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:58:25,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:58:25,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:58:25,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:25,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:58:25,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:58:25,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:58:25,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:58:25,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:58:25,684 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:58:25,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:58:25,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:58:25,685 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8 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 -> 236a73c15e935747b9f2e95e881c26c921eba2f2ad7a2b23cf05552665b9f683 [2022-11-16 10:58:25,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:58:26,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:58:26,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:58:26,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:58:26,013 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:58:26,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread/sigma.i [2022-11-16 10:58:26,096 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/data/705ed73b8/62c80aa06e4648ce9309f4b45b650cd4/FLAG5e26557ea [2022-11-16 10:58:26,724 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:58:26,724 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/sv-benchmarks/c/pthread/sigma.i [2022-11-16 10:58:26,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/data/705ed73b8/62c80aa06e4648ce9309f4b45b650cd4/FLAG5e26557ea [2022-11-16 10:58:26,990 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/data/705ed73b8/62c80aa06e4648ce9309f4b45b650cd4 [2022-11-16 10:58:26,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:58:26,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:58:26,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:26,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:58:27,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:58:27,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:26" (1/1) ... [2022-11-16 10:58:27,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fbdad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:27, skipping insertion in model container [2022-11-16 10:58:27,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:26" (1/1) ... [2022-11-16 10:58:27,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:58:27,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:58:27,925 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/sv-benchmarks/c/pthread/sigma.i[55285,55298] [2022-11-16 10:58:27,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:27,966 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:58:28,009 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/sv-benchmarks/c/pthread/sigma.i[55285,55298] [2022-11-16 10:58:28,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:28,101 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:58:28,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28 WrapperNode [2022-11-16 10:58:28,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:28,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:28,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:58:28,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:58:28,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,208 INFO L138 Inliner]: procedures = 323, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2022-11-16 10:58:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:28,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:58:28,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:58:28,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:58:28,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:58:28,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:58:28,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:58:28,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:58:28,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (1/1) ... [2022-11-16 10:58:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:28,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:58:28,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743d186-8a34-4535-9ec0-baf3fc969702/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 10:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 10:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 10:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 10:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-11-16 10:58:28,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-11-16 10:58:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:58:28,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:58:28,421 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 10:58:28,581 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:58:28,584 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:58:29,145 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:58:29,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:58:29,155 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 10:58:29,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:29 BoogieIcfgContainer [2022-11-16 10:58:29,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:58:29,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:58:29,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:58:29,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:58:29,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:26" (1/3) ... [2022-11-16 10:58:29,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2030164b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:29, skipping insertion in model container [2022-11-16 10:58:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:28" (2/3) ... [2022-11-16 10:58:29,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2030164b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:29, skipping insertion in model container [2022-11-16 10:58:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:29" (3/3) ... [2022-11-16 10:58:29,170 INFO L112 eAbstractionObserver]: Analyzing ICFG sigma.i [2022-11-16 10:58:29,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 10:58:29,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:58:29,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-16 10:58:29,192 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:58:29,280 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 10:58:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 200 transitions, 408 flow [2022-11-16 10:58:29,420 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-16 10:58:29,420 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 10:58:29,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 289 events. 13/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 643 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 168. Up to 4 conditions per place. [2022-11-16 10:58:29,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 200 transitions, 408 flow [2022-11-16 10:58:29,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 200 transitions, 408 flow [2022-11-16 10:58:29,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:58:29,466 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a1ca94e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:58:29,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-16 10:58:29,479 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-16 10:58:29,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:58:29,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:29,480 INFO L209 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] [2022-11-16 10:58:29,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:29,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash 330422103, now seen corresponding path program 1 times [2022-11-16 10:58:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:29,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84938115] [2022-11-16 10:58:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84938115] [2022-11-16 10:58:29,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84938115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:29,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:29,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:58:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056602829] [2022-11-16 10:58:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:29,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:29,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:29,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 200 [2022-11-16 10:58:29,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 200 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-11-16 10:58:29,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:29,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 200 [2022-11-16 10:58:29,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:30,149 INFO L130 PetriNetUnfolder]: 3/267 cut-off events. [2022-11-16 10:58:30,150 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 10:58:30,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 267 events. 3/267 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 516 event pairs, 0 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 167. Up to 22 conditions per place. [2022-11-16 10:58:30,153 INFO L137 encePairwiseOnDemand]: 187/200 looper letters, 13 selfloop transitions, 1 changer transitions 2/187 dead transitions. [2022-11-16 10:58:30,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 187 transitions, 410 flow [2022-11-16 10:58:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:58:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2022-11-16 10:58:30,170 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9083333333333333 [2022-11-16 10:58:30,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2022-11-16 10:58:30,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2022-11-16 10:58:30,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:30,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2022-11-16 10:58:30,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-11-16 10:58:30,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:30,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:30,201 INFO L175 Difference]: Start difference. First operand has 195 places, 200 transitions, 408 flow. Second operand 3 states and 545 transitions. [2022-11-16 10:58:30,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 187 transitions, 410 flow [2022-11-16 10:58:30,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:58:30,222 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 380 flow [2022-11-16 10:58:30,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2022-11-16 10:58:30,230 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -5 predicate places. [2022-11-16 10:58:30,230 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 380 flow [2022-11-16 10:58:30,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-11-16 10:58:30,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:30,232 INFO L209 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] [2022-11-16 10:58:30,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:58:30,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -762852288, now seen corresponding path program 1 times [2022-11-16 10:58:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:30,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775392492] [2022-11-16 10:58:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:30,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:30,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:30,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775392492] [2022-11-16 10:58:30,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775392492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:30,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:30,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:58:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538383179] [2022-11-16 10:58:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:30,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:58:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:30,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:58:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:58:30,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 200 [2022-11-16 10:58:30,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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-11-16 10:58:30,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:30,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 200 [2022-11-16 10:58:30,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:31,494 INFO L130 PetriNetUnfolder]: 171/684 cut-off events. [2022-11-16 10:58:31,495 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 10:58:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 684 events. 171/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3286 event pairs, 168 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 1076. Up to 413 conditions per place. [2022-11-16 10:58:31,505 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 48 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2022-11-16 10:58:31,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 184 transitions, 484 flow [2022-11-16 10:58:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:58:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:58:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2022-11-16 10:58:31,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.74 [2022-11-16 10:58:31,516 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 888 transitions. [2022-11-16 10:58:31,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 888 transitions. [2022-11-16 10:58:31,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:31,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 888 transitions. [2022-11-16 10:58:31,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:31,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:31,532 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:31,532 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 380 flow. Second operand 6 states and 888 transitions. [2022-11-16 10:58:31,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 184 transitions, 484 flow [2022-11-16 10:58:31,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 184 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:58:31,546 INFO L231 Difference]: Finished difference. Result has 191 places, 184 transitions, 387 flow [2022-11-16 10:58:31,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=184} [2022-11-16 10:58:31,548 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -4 predicate places. [2022-11-16 10:58:31,548 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 184 transitions, 387 flow [2022-11-16 10:58:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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-11-16 10:58:31,549 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:31,550 INFO L209 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] [2022-11-16 10:58:31,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:58:31,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash 918137177, now seen corresponding path program 1 times [2022-11-16 10:58:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:31,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294191748] [2022-11-16 10:58:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:31,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:31,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294191748] [2022-11-16 10:58:31,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294191748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:31,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:31,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:58:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936342305] [2022-11-16 10:58:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:31,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:31,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 200 [2022-11-16 10:58:31,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 184 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-11-16 10:58:31,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:31,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 200 [2022-11-16 10:58:31,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:31,803 INFO L130 PetriNetUnfolder]: 12/323 cut-off events. [2022-11-16 10:58:31,804 INFO L131 PetriNetUnfolder]: For 4/7 co-relation queries the response was YES. [2022-11-16 10:58:31,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 323 events. 12/323 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 861 event pairs, 9 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 341. Up to 36 conditions per place. [2022-11-16 10:58:31,807 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2022-11-16 10:58:31,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 183 transitions, 417 flow [2022-11-16 10:58:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:58:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2022-11-16 10:58:31,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9083333333333333 [2022-11-16 10:58:31,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2022-11-16 10:58:31,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2022-11-16 10:58:31,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:31,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2022-11-16 10:58:31,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-11-16 10:58:31,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:31,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:31,820 INFO L175 Difference]: Start difference. First operand has 191 places, 184 transitions, 387 flow. Second operand 3 states and 545 transitions. [2022-11-16 10:58:31,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 183 transitions, 417 flow [2022-11-16 10:58:31,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 183 transitions, 407 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 10:58:31,830 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 379 flow [2022-11-16 10:58:31,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-11-16 10:58:31,833 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -8 predicate places. [2022-11-16 10:58:31,834 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 379 flow [2022-11-16 10:58:31,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-11-16 10:58:31,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:31,835 INFO L209 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] [2022-11-16 10:58:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:58:31,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1169195822, now seen corresponding path program 1 times [2022-11-16 10:58:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:31,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935694798] [2022-11-16 10:58:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:32,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935694798] [2022-11-16 10:58:32,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935694798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:32,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:32,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:58:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067928785] [2022-11-16 10:58:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:58:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:58:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:58:32,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 200 [2022-11-16 10:58:32,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 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-11-16 10:58:32,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:32,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 200 [2022-11-16 10:58:32,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:33,008 INFO L130 PetriNetUnfolder]: 240/900 cut-off events. [2022-11-16 10:58:33,009 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 10:58:33,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 900 events. 240/900 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4652 event pairs, 10 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1470. Up to 386 conditions per place. [2022-11-16 10:58:33,016 INFO L137 encePairwiseOnDemand]: 178/200 looper letters, 76 selfloop transitions, 28 changer transitions 0/236 dead transitions. [2022-11-16 10:58:33,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 236 transitions, 696 flow [2022-11-16 10:58:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:58:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:58:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2022-11-16 10:58:33,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7941666666666667 [2022-11-16 10:58:33,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 953 transitions. [2022-11-16 10:58:33,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 953 transitions. [2022-11-16 10:58:33,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:33,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 953 transitions. [2022-11-16 10:58:33,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 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-11-16 10:58:33,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:33,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:33,034 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 379 flow. Second operand 6 states and 953 transitions. [2022-11-16 10:58:33,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 236 transitions, 696 flow [2022-11-16 10:58:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 236 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:58:33,042 INFO L231 Difference]: Finished difference. Result has 194 places, 206 transitions, 567 flow [2022-11-16 10:58:33,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=194, PETRI_TRANSITIONS=206} [2022-11-16 10:58:33,046 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -1 predicate places. [2022-11-16 10:58:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 206 transitions, 567 flow [2022-11-16 10:58:33,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 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-11-16 10:58:33,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:33,047 INFO L209 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] [2022-11-16 10:58:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:58:33,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash -927067717, now seen corresponding path program 1 times [2022-11-16 10:58:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:33,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51432343] [2022-11-16 10:58:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51432343] [2022-11-16 10:58:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51432343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:33,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:58:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732695026] [2022-11-16 10:58:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:33,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 200 [2022-11-16 10:58:33,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 206 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-11-16 10:58:33,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:33,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 200 [2022-11-16 10:58:33,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:33,247 INFO L130 PetriNetUnfolder]: 53/537 cut-off events. [2022-11-16 10:58:33,247 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-16 10:58:33,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 537 events. 53/537 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2229 event pairs, 4 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 807. Up to 68 conditions per place. [2022-11-16 10:58:33,250 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 9 selfloop transitions, 1 changer transitions 0/203 dead transitions. [2022-11-16 10:58:33,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 203 transitions, 581 flow [2022-11-16 10:58:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:58:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2022-11-16 10:58:33,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-11-16 10:58:33,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2022-11-16 10:58:33,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2022-11-16 10:58:33,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:33,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2022-11-16 10:58:33,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-11-16 10:58:33,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,259 INFO L175 Difference]: Start difference. First operand has 194 places, 206 transitions, 567 flow. Second operand 3 states and 550 transitions. [2022-11-16 10:58:33,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 203 transitions, 581 flow [2022-11-16 10:58:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 203 transitions, 581 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:58:33,267 INFO L231 Difference]: Finished difference. Result has 193 places, 203 transitions, 563 flow [2022-11-16 10:58:33,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=193, PETRI_TRANSITIONS=203} [2022-11-16 10:58:33,269 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -2 predicate places. [2022-11-16 10:58:33,269 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 203 transitions, 563 flow [2022-11-16 10:58:33,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-11-16 10:58:33,270 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:33,270 INFO L209 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] [2022-11-16 10:58:33,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:58:33,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:33,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1591106089, now seen corresponding path program 1 times [2022-11-16 10:58:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:33,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107472309] [2022-11-16 10:58:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:33,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107472309] [2022-11-16 10:58:33,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107472309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:33,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:33,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:58:33,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179747126] [2022-11-16 10:58:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:33,341 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 200 [2022-11-16 10:58:33,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 203 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-11-16 10:58:33,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:33,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 200 [2022-11-16 10:58:33,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:33,509 INFO L130 PetriNetUnfolder]: 83/746 cut-off events. [2022-11-16 10:58:33,510 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-11-16 10:58:33,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 746 events. 83/746 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3776 event pairs, 4 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 1181. Up to 106 conditions per place. [2022-11-16 10:58:33,513 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 4 changer transitions 0/207 dead transitions. [2022-11-16 10:58:33,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 207 transitions, 601 flow [2022-11-16 10:58:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:58:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2022-11-16 10:58:33,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9383333333333334 [2022-11-16 10:58:33,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2022-11-16 10:58:33,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2022-11-16 10:58:33,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:33,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2022-11-16 10:58:33,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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-11-16 10:58:33,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,521 INFO L175 Difference]: Start difference. First operand has 193 places, 203 transitions, 563 flow. Second operand 3 states and 563 transitions. [2022-11-16 10:58:33,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 207 transitions, 601 flow [2022-11-16 10:58:33,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 207 transitions, 600 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:58:33,528 INFO L231 Difference]: Finished difference. Result has 195 places, 205 transitions, 590 flow [2022-11-16 10:58:33,529 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=195, PETRI_TRANSITIONS=205} [2022-11-16 10:58:33,529 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2022-11-16 10:58:33,530 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 205 transitions, 590 flow [2022-11-16 10:58:33,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-11-16 10:58:33,530 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:33,530 INFO L209 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] [2022-11-16 10:58:33,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:58:33,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1082211098, now seen corresponding path program 1 times [2022-11-16 10:58:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:33,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000824] [2022-11-16 10:58:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000824] [2022-11-16 10:58:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:58:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675751795] [2022-11-16 10:58:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:33,591 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 200 [2022-11-16 10:58:33,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 205 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-11-16 10:58:33,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:33,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 200 [2022-11-16 10:58:33,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:33,757 INFO L130 PetriNetUnfolder]: 87/797 cut-off events. [2022-11-16 10:58:33,758 INFO L131 PetriNetUnfolder]: For 117/123 co-relation queries the response was YES. [2022-11-16 10:58:33,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 797 events. 87/797 cut-off events. For 117/123 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4299 event pairs, 7 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 1309. Up to 118 conditions per place. [2022-11-16 10:58:33,763 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 18 selfloop transitions, 4 changer transitions 0/211 dead transitions. [2022-11-16 10:58:33,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 211 transitions, 658 flow [2022-11-16 10:58:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:58:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2022-11-16 10:58:33,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9266666666666666 [2022-11-16 10:58:33,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2022-11-16 10:58:33,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2022-11-16 10:58:33,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:33,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2022-11-16 10:58:33,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-11-16 10:58:33,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-11-16 10:58:33,772 INFO L175 Difference]: Start difference. First operand has 195 places, 205 transitions, 590 flow. Second operand 3 states and 556 transitions. [2022-11-16 10:58:33,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 211 transitions, 658 flow [2022-11-16 10:58:33,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 211 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:58:33,780 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 614 flow [2022-11-16 10:58:33,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2022-11-16 10:58:33,781 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, 2 predicate places. [2022-11-16 10:58:33,781 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 614 flow [2022-11-16 10:58:33,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-11-16 10:58:33,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:33,782 INFO L209 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] [2022-11-16 10:58:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:58:33,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 481916171, now seen corresponding path program 1 times [2022-11-16 10:58:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:33,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001801090] [2022-11-16 10:58:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:33,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001801090] [2022-11-16 10:58:33,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001801090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:33,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:33,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:58:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178230367] [2022-11-16 10:58:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:58:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:58:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:58:33,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 200 [2022-11-16 10:58:33,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-11-16 10:58:33,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:33,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 200 [2022-11-16 10:58:33,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:34,200 INFO L130 PetriNetUnfolder]: 77/639 cut-off events. [2022-11-16 10:58:34,201 INFO L131 PetriNetUnfolder]: For 114/121 co-relation queries the response was YES. [2022-11-16 10:58:34,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 639 events. 77/639 cut-off events. For 114/121 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3210 event pairs, 1 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 1178. Up to 103 conditions per place. [2022-11-16 10:58:34,206 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 40 selfloop transitions, 5 changer transitions 18/217 dead transitions. [2022-11-16 10:58:34,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 217 transitions, 726 flow [2022-11-16 10:58:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:58:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 10:58:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2022-11-16 10:58:34,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8375 [2022-11-16 10:58:34,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2022-11-16 10:58:34,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2022-11-16 10:58:34,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:34,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2022-11-16 10:58:34,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.5) internal successors, (670), 4 states have internal predecessors, (670), 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-11-16 10:58:34,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-11-16 10:58:34,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-11-16 10:58:34,215 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 614 flow. Second operand 4 states and 670 transitions. [2022-11-16 10:58:34,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 217 transitions, 726 flow [2022-11-16 10:58:34,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 217 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:58:34,224 INFO L231 Difference]: Finished difference. Result has 199 places, 190 transitions, 580 flow [2022-11-16 10:58:34,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=580, PETRI_PLACES=199, PETRI_TRANSITIONS=190} [2022-11-16 10:58:34,225 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, 4 predicate places. [2022-11-16 10:58:34,226 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 190 transitions, 580 flow [2022-11-16 10:58:34,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-11-16 10:58:34,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:34,227 INFO L209 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] [2022-11-16 10:58:34,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:58:34,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1661494317, now seen corresponding path program 1 times [2022-11-16 10:58:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:34,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360079710] [2022-11-16 10:58:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360079710] [2022-11-16 10:58:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360079710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:34,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:34,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:58:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421879538] [2022-11-16 10:58:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:34,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:58:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:58:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:58:34,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 200 [2022-11-16 10:58:34,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 190 transitions, 580 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 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-11-16 10:58:34,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:58:34,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 200 [2022-11-16 10:58:34,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:58:35,661 INFO L130 PetriNetUnfolder]: 470/1454 cut-off events. [2022-11-16 10:58:35,661 INFO L131 PetriNetUnfolder]: For 497/575 co-relation queries the response was YES. [2022-11-16 10:58:35,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 1454 events. 470/1454 cut-off events. For 497/575 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8916 event pairs, 90 based on Foata normal form. 11/1378 useless extension candidates. Maximal degree in co-relation 3528. Up to 848 conditions per place. [2022-11-16 10:58:35,674 INFO L137 encePairwiseOnDemand]: 180/200 looper letters, 103 selfloop transitions, 67 changer transitions 0/286 dead transitions. [2022-11-16 10:58:35,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 286 transitions, 1286 flow [2022-11-16 10:58:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:58:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:58:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 972 transitions. [2022-11-16 10:58:35,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.81 [2022-11-16 10:58:35,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 972 transitions. [2022-11-16 10:58:35,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 972 transitions. [2022-11-16 10:58:35,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:58:35,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 972 transitions. [2022-11-16 10:58:35,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 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-11-16 10:58:35,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:35,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-11-16 10:58:35,687 INFO L175 Difference]: Start difference. First operand has 199 places, 190 transitions, 580 flow. Second operand 6 states and 972 transitions. [2022-11-16 10:58:35,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 286 transitions, 1286 flow [2022-11-16 10:58:35,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 286 transitions, 1276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 10:58:35,701 INFO L231 Difference]: Finished difference. Result has 190 places, 256 transitions, 1148 flow [2022-11-16 10:58:35,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=190, PETRI_TRANSITIONS=256} [2022-11-16 10:58:35,703 INFO L288 CegarLoopForPetriNet]: 195 programPoint places, -5 predicate places. [2022-11-16 10:58:35,703 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 256 transitions, 1148 flow [2022-11-16 10:58:35,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 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-11-16 10:58:35,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:58:35,704 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 10:58:35,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:58:35,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-16 10:58:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1702888496, now seen corresponding path program 1 times [2022-11-16 10:58:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039982565] [2022-11-16 10:58:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:58:35,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:58:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:58:35,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:58:35,826 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:58:35,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (23 of 24 remaining) [2022-11-16 10:58:35,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2022-11-16 10:58:35,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2022-11-16 10:58:35,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2022-11-16 10:58:35,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2022-11-16 10:58:35,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2022-11-16 10:58:35,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2022-11-16 10:58:35,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2022-11-16 10:58:35,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2022-11-16 10:58:35,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2022-11-16 10:58:35,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2022-11-16 10:58:35,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2022-11-16 10:58:35,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2022-11-16 10:58:35,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2022-11-16 10:58:35,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2022-11-16 10:58:35,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2022-11-16 10:58:35,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2022-11-16 10:58:35,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2022-11-16 10:58:35,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 24 remaining) [2022-11-16 10:58:35,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2022-11-16 10:58:35,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2022-11-16 10:58:35,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2022-11-16 10:58:35,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2022-11-16 10:58:35,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2022-11-16 10:58:35,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:58:35,835 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:35,843 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:58:35,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:58:35,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:58:35 BasicIcfg [2022-11-16 10:58:35,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:58:35,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:58:35,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:58:35,916 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:58:35,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:29" (3/4) ... [2022-11-16 10:58:35,919 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:58:35,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:58:35,920 INFO L158 Benchmark]: Toolchain (without parser) took 8924.04ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 112.6MB in the beginning and 96.7MB in the end (delta: 15.9MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,920 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:35,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1103.25ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 94.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,921 INFO L158 Benchmark]: Boogie Preprocessor took 85.09ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,921 INFO L158 Benchmark]: RCFGBuilder took 849.60ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 111.8MB in the end (delta: -22.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,922 INFO L158 Benchmark]: TraceAbstraction took 6754.12ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 111.8MB in the beginning and 97.8MB in the end (delta: 14.1MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2022-11-16 10:58:35,922 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 220.2MB. Free memory was 97.8MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:35,929 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.27ms. Allocated memory is still 98.6MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1103.25ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 94.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.09ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 849.60ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 111.8MB in the end (delta: -22.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6754.12ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 111.8MB in the beginning and 97.8MB in the end (delta: 14.1MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 220.2MB. Free memory was 97.8MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1117]: Data race detected Data race detected The following path leads to a data race: [L1113] 0 int *array; VAL [array={0:0}] [L1112] 0 const int SIGMA = 16; VAL [array={0:0}, SIGMA=16] [L1114] 0 int array_index=-1; VAL [array={0:0}, array_index=-1, SIGMA=16] [L1122] 0 int tid, sum; VAL [array={0:0}, array_index=-1, SIGMA=16] [L1123] 0 pthread_t *t; VAL [array={0:0}, array_index=-1, SIGMA=16, t={9:0}] [L1124] EXPR 0 sizeof(pthread_t) * SIGMA VAL [array={0:0}, array_index=-1, SIGMA=16, t={9:0}] [L1124] 0 t = (pthread_t *)malloc(sizeof(pthread_t) * SIGMA) VAL [array={0:0}, array_index=-1, malloc(sizeof(pthread_t) * SIGMA)={3:0}, SIGMA=16, t={9:0}, t = (pthread_t *)malloc(sizeof(pthread_t) * SIGMA)=118] [L1125] EXPR 0 sizeof(int) * SIGMA VAL [array={0:0}, array_index=-1, SIGMA=16, t={9:0}] [L1125] 0 array = (int *)malloc(sizeof(int) * SIGMA) VAL [array={4:0}, array = (int *)malloc(sizeof(int) * SIGMA)=120, array_index=-1, malloc(sizeof(int) * SIGMA)={4:0}, SIGMA=16, t={9:0}] [L1126] EXPR 0 \read(*t) VAL [\read(*t)={3:0}, array={4:0}, array_index=-1, SIGMA=16, t={9:0}] [L1126] 0 assume_abort_if_not(t) VAL [\read(*t)={3:0}, array={4:0}, array_index=-1, SIGMA=16, t={9:0}] [L1126] CALL 0 assume_abort_if_not(t) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=3, array={4:0}, array_index=-1, cond=3, SIGMA=16] [L1126] RET 0 assume_abort_if_not(t) [L1127] 0 assume_abort_if_not(array) VAL [array={4:0}, array_index=-1, SIGMA=16, t={9:0}] [L1127] CALL 0 assume_abort_if_not(array) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=4, array={4:0}, array_index=-1, cond=4, SIGMA=16] [L1127] RET 0 assume_abort_if_not(array) [L1128] 0 tid=0 VAL [array={4:0}, array_index=-1, SIGMA=16, t={9:0}, tid=0] [L1128] 0 tid