./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a 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_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc --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 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 --- 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-5e519f3 [2022-11-02 20:59:45,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:59:45,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:59:45,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:59:45,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:59:45,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:59:45,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:59:45,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:59:45,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:59:45,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:59:45,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:59:45,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:59:45,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:59:45,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:59:45,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:59:45,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:59:45,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:59:45,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:59:45,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:59:45,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:59:45,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:59:45,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:59:45,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:59:45,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:59:45,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:59:45,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:59:45,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:59:45,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:59:45,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:59:45,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:59:45,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:59:45,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:59:45,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:59:45,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:59:45,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:59:45,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:59:45,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:59:45,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:59:45,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:59:45,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:59:45,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:59:45,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:59:45,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:59:45,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:59:45,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:59:45,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:59:45,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:59:45,593 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:59:45,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:59:45,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:59:45,594 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:59:45,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:59:45,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:59:45,595 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:59:45,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:59:45,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:59:45,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:59:45,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:59:45,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:59:45,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:59:45,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:59:45,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:59:45,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:59:45,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:45,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:59:45,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:59:45,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:59:45,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:59:45,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:59:45,602 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:59:45,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:59:45,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:59:45,603 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_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/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_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc 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 -> 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 [2022-11-02 20:59:45,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:59:45,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:59:45,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:59:45,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:59:45,927 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:59:45,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2022-11-02 20:59:45,999 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/data/c3dbf38e7/e9af5aaabf7c47a8aa72b9430afe733e/FLAG53a738a2e [2022-11-02 20:59:46,552 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:59:46,552 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2022-11-02 20:59:46,591 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/data/c3dbf38e7/e9af5aaabf7c47a8aa72b9430afe733e/FLAG53a738a2e [2022-11-02 20:59:46,814 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/data/c3dbf38e7/e9af5aaabf7c47a8aa72b9430afe733e [2022-11-02 20:59:46,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:59:46,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:59:46,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:46,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:59:46,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:59:46,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:46" (1/1) ... [2022-11-02 20:59:46,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bf03e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:46, skipping insertion in model container [2022-11-02 20:59:46,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:46" (1/1) ... [2022-11-02 20:59:46,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:59:46,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:59:47,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:47,500 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:59:47,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:47,626 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:59:47,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47 WrapperNode [2022-11-02 20:59:47,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:47,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:47,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:59:47,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:59:47,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,712 INFO L138 Inliner]: procedures = 365, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-11-02 20:59:47,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:47,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:59:47,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:59:47,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:59:47,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,750 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:59:47,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:59:47,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:59:47,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:59:47,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (1/1) ... [2022-11-02 20:59:47,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:47,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:59:47,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-02 20:59:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-02 20:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:59:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:59:47,865 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:59:48,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:59:48,088 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:59:48,369 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:59:48,377 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:59:48,377 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:59:48,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:48 BoogieIcfgContainer [2022-11-02 20:59:48,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:59:48,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:59:48,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:59:48,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:59:48,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:59:46" (1/3) ... [2022-11-02 20:59:48,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe11606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:48, skipping insertion in model container [2022-11-02 20:59:48,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:47" (2/3) ... [2022-11-02 20:59:48,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe11606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:48, skipping insertion in model container [2022-11-02 20:59:48,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:48" (3/3) ... [2022-11-02 20:59:48,396 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2022-11-02 20:59:48,405 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:59:48,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:59:48,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-02 20:59:48,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:59:48,482 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:59:48,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 114 transitions, 233 flow [2022-11-02 20:59:48,634 INFO L130 PetriNetUnfolder]: 0/113 cut-off events. [2022-11-02 20:59:48,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:59:48,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 113 events. 0/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-11-02 20:59:48,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 114 transitions, 233 flow [2022-11-02 20:59:48,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 113 transitions, 229 flow [2022-11-02 20:59:48,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:59:48,666 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;@6bf0406b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:59:48,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-02 20:59:48,686 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-11-02 20:59:48,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:59:48,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:48,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:48,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -796788612, now seen corresponding path program 1 times [2022-11-02 20:59:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:48,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14940224] [2022-11-02 20:59:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:48,997 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-02 20:59:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14940224] [2022-11-02 20:59:49,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14940224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:49,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:49,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860910556] [2022-11-02 20:59:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:49,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:49,064 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-11-02 20:59:49,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-02 20:59:49,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:49,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-11-02 20:59:49,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:49,188 INFO L130 PetriNetUnfolder]: 9/235 cut-off events. [2022-11-02 20:59:49,189 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:59:49,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 235 events. 9/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 775 event pairs, 9 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 212. Up to 29 conditions per place. [2022-11-02 20:59:49,193 INFO L137 encePairwiseOnDemand]: 111/114 looper letters, 10 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-11-02 20:59:49,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 251 flow [2022-11-02 20:59:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:59:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2022-11-02 20:59:49,208 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2022-11-02 20:59:49,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:49,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-02 20:59:49,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,226 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 229 flow. Second operand 3 states and 316 transitions. [2022-11-02 20:59:49,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 251 flow [2022-11-02 20:59:49,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 112 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:59:49,234 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 230 flow [2022-11-02 20:59:49,236 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2022-11-02 20:59:49,240 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2022-11-02 20:59:49,240 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 230 flow [2022-11-02 20:59:49,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-02 20:59:49,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:49,241 INFO L208 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] [2022-11-02 20:59:49,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:59:49,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1918488513, now seen corresponding path program 1 times [2022-11-02 20:59:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:49,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68525114] [2022-11-02 20:59:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:49,343 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-02 20:59:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68525114] [2022-11-02 20:59:49,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68525114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:49,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:49,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288762282] [2022-11-02 20:59:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:49,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:49,348 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-11-02 20:59:49,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-02 20:59:49,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:49,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-11-02 20:59:49,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:49,409 INFO L130 PetriNetUnfolder]: 9/183 cut-off events. [2022-11-02 20:59:49,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:59:49,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 183 events. 9/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 414 event pairs, 9 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 29 conditions per place. [2022-11-02 20:59:49,411 INFO L137 encePairwiseOnDemand]: 111/114 looper letters, 10 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-11-02 20:59:49,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 111 transitions, 252 flow [2022-11-02 20:59:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:59:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2022-11-02 20:59:49,414 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2022-11-02 20:59:49,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:49,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2022-11-02 20:59:49,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-02 20:59:49,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,419 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 230 flow. Second operand 3 states and 316 transitions. [2022-11-02 20:59:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 111 transitions, 252 flow [2022-11-02 20:59:49,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:59:49,423 INFO L231 Difference]: Finished difference. Result has 116 places, 111 transitions, 228 flow [2022-11-02 20:59:49,423 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=116, PETRI_TRANSITIONS=111} [2022-11-02 20:59:49,424 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2022-11-02 20:59:49,424 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 228 flow [2022-11-02 20:59:49,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-02 20:59:49,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:49,425 INFO L208 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] [2022-11-02 20:59:49,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:59:49,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2011316591, now seen corresponding path program 1 times [2022-11-02 20:59:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:49,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724114860] [2022-11-02 20:59:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:49,527 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-02 20:59:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724114860] [2022-11-02 20:59:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724114860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:49,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:49,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:49,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479586418] [2022-11-02 20:59:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:49,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:49,536 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 114 [2022-11-02 20:59:49,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 111 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:49,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:49,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 114 [2022-11-02 20:59:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:49,626 INFO L130 PetriNetUnfolder]: 4/195 cut-off events. [2022-11-02 20:59:49,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:59:49,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 195 events. 4/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 533 event pairs, 2 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 168. Up to 12 conditions per place. [2022-11-02 20:59:49,628 INFO L137 encePairwiseOnDemand]: 110/114 looper letters, 7 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-11-02 20:59:49,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 246 flow [2022-11-02 20:59:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:59:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-11-02 20:59:49,635 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2022-11-02 20:59:49,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-11-02 20:59:49,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-11-02 20:59:49,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:49,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-11-02 20:59:49,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-02 20:59:49,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:49,645 INFO L175 Difference]: Start difference. First operand has 116 places, 111 transitions, 228 flow. Second operand 3 states and 323 transitions. [2022-11-02 20:59:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 246 flow [2022-11-02 20:59:49,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:59:49,653 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 234 flow [2022-11-02 20:59:49,653 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2022-11-02 20:59:49,655 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-11-02 20:59:49,658 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 234 flow [2022-11-02 20:59:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:49,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:49,660 INFO L208 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] [2022-11-02 20:59:49,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:59:49,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -576174563, now seen corresponding path program 1 times [2022-11-02 20:59:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:49,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824454694] [2022-11-02 20:59:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:50,399 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-02 20:59:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:50,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824454694] [2022-11-02 20:59:50,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824454694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:50,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:50,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396822339] [2022-11-02 20:59:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:50,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:59:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:59:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:50,409 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:59:50,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-02 20:59:50,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:50,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:59:50,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:50,900 INFO L130 PetriNetUnfolder]: 290/964 cut-off events. [2022-11-02 20:59:50,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:59:50,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 964 events. 290/964 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5391 event pairs, 130 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1549. Up to 437 conditions per place. [2022-11-02 20:59:50,907 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 62 selfloop transitions, 41 changer transitions 0/183 dead transitions. [2022-11-02 20:59:50,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 584 flow [2022-11-02 20:59:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:59:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2022-11-02 20:59:50,910 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8801169590643275 [2022-11-02 20:59:50,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2022-11-02 20:59:50,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2022-11-02 20:59:50,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:50,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2022-11-02 20:59:50,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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-02 20:59:50,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:50,915 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:50,915 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 234 flow. Second operand 6 states and 602 transitions. [2022-11-02 20:59:50,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 584 flow [2022-11-02 20:59:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 183 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:59:50,920 INFO L231 Difference]: Finished difference. Result has 124 places, 153 transitions, 492 flow [2022-11-02 20:59:50,920 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=124, PETRI_TRANSITIONS=153} [2022-11-02 20:59:50,921 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2022-11-02 20:59:50,921 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 153 transitions, 492 flow [2022-11-02 20:59:50,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-02 20:59:50,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:50,922 INFO L208 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] [2022-11-02 20:59:50,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:59:50,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -906441389, now seen corresponding path program 1 times [2022-11-02 20:59:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375115142] [2022-11-02 20:59:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:51,362 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-02 20:59:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:51,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375115142] [2022-11-02 20:59:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375115142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328732423] [2022-11-02 20:59:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:51,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:59:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:59:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:51,367 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-02 20:59:51,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 153 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-02 20:59:51,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:51,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-02 20:59:51,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:51,974 INFO L130 PetriNetUnfolder]: 446/1503 cut-off events. [2022-11-02 20:59:51,975 INFO L131 PetriNetUnfolder]: For 384/416 co-relation queries the response was YES. [2022-11-02 20:59:51,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 1503 events. 446/1503 cut-off events. For 384/416 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10120 event pairs, 34 based on Foata normal form. 25/1405 useless extension candidates. Maximal degree in co-relation 3292. Up to 453 conditions per place. [2022-11-02 20:59:51,987 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 129 selfloop transitions, 48 changer transitions 0/263 dead transitions. [2022-11-02 20:59:51,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 263 transitions, 1241 flow [2022-11-02 20:59:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:59:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 632 transitions. [2022-11-02 20:59:51,990 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2022-11-02 20:59:51,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 632 transitions. [2022-11-02 20:59:51,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 632 transitions. [2022-11-02 20:59:51,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:51,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 632 transitions. [2022-11-02 20:59:51,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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-02 20:59:51,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:51,996 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:51,997 INFO L175 Difference]: Start difference. First operand has 124 places, 153 transitions, 492 flow. Second operand 6 states and 632 transitions. [2022-11-02 20:59:51,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 263 transitions, 1241 flow [2022-11-02 20:59:52,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 263 transitions, 1241 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:59:52,011 INFO L231 Difference]: Finished difference. Result has 134 places, 199 transitions, 898 flow [2022-11-02 20:59:52,011 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=134, PETRI_TRANSITIONS=199} [2022-11-02 20:59:52,015 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-11-02 20:59:52,015 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 199 transitions, 898 flow [2022-11-02 20:59:52,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-02 20:59:52,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:52,016 INFO L208 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] [2022-11-02 20:59:52,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:59:52,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2126821387, now seen corresponding path program 1 times [2022-11-02 20:59:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402015603] [2022-11-02 20:59:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:52,095 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-02 20:59:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402015603] [2022-11-02 20:59:52,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402015603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:52,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:52,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723250094] [2022-11-02 20:59:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:52,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:52,101 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 114 [2022-11-02 20:59:52,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 199 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:52,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:52,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 114 [2022-11-02 20:59:52,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:52,314 INFO L130 PetriNetUnfolder]: 209/1027 cut-off events. [2022-11-02 20:59:52,314 INFO L131 PetriNetUnfolder]: For 588/666 co-relation queries the response was YES. [2022-11-02 20:59:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 1027 events. 209/1027 cut-off events. For 588/666 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6936 event pairs, 16 based on Foata normal form. 14/1009 useless extension candidates. Maximal degree in co-relation 2182. Up to 206 conditions per place. [2022-11-02 20:59:52,323 INFO L137 encePairwiseOnDemand]: 110/114 looper letters, 7 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2022-11-02 20:59:52,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 199 transitions, 916 flow [2022-11-02 20:59:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:59:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-11-02 20:59:52,325 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2022-11-02 20:59:52,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-11-02 20:59:52,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-11-02 20:59:52,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:52,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-11-02 20:59:52,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-02 20:59:52,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:52,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:52,329 INFO L175 Difference]: Start difference. First operand has 134 places, 199 transitions, 898 flow. Second operand 3 states and 323 transitions. [2022-11-02 20:59:52,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 199 transitions, 916 flow [2022-11-02 20:59:52,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 199 transitions, 908 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-02 20:59:52,340 INFO L231 Difference]: Finished difference. Result has 135 places, 199 transitions, 900 flow [2022-11-02 20:59:52,341 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=135, PETRI_TRANSITIONS=199} [2022-11-02 20:59:52,344 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-11-02 20:59:52,344 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 199 transitions, 900 flow [2022-11-02 20:59:52,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:52,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:52,347 INFO L208 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] [2022-11-02 20:59:52,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:59:52,348 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1656224381, now seen corresponding path program 1 times [2022-11-02 20:59:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:52,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088164367] [2022-11-02 20:59:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:52,488 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-02 20:59:52,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:52,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088164367] [2022-11-02 20:59:52,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088164367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:52,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:52,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36426670] [2022-11-02 20:59:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:52,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:52,498 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 114 [2022-11-02 20:59:52,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 199 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-02 20:59:52,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:52,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 114 [2022-11-02 20:59:52,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:52,572 INFO L130 PetriNetUnfolder]: 40/319 cut-off events. [2022-11-02 20:59:52,572 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-11-02 20:59:52,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 319 events. 40/319 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1143 event pairs, 4 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 526. Up to 68 conditions per place. [2022-11-02 20:59:52,575 INFO L137 encePairwiseOnDemand]: 110/114 looper letters, 7 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2022-11-02 20:59:52,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 456 flow [2022-11-02 20:59:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:59:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-11-02 20:59:52,578 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9415204678362573 [2022-11-02 20:59:52,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2022-11-02 20:59:52,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2022-11-02 20:59:52,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:52,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2022-11-02 20:59:52,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-02 20:59:52,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:52,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-02 20:59:52,582 INFO L175 Difference]: Start difference. First operand has 135 places, 199 transitions, 900 flow. Second operand 3 states and 322 transitions. [2022-11-02 20:59:52,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 456 flow [2022-11-02 20:59:52,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 406 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-11-02 20:59:52,587 INFO L231 Difference]: Finished difference. Result has 128 places, 132 transitions, 392 flow [2022-11-02 20:59:52,587 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=128, PETRI_TRANSITIONS=132} [2022-11-02 20:59:52,588 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2022-11-02 20:59:52,588 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 132 transitions, 392 flow [2022-11-02 20:59:52,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-02 20:59:52,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:52,589 INFO L208 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] [2022-11-02 20:59:52,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:59:52,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2062702493, now seen corresponding path program 1 times [2022-11-02 20:59:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:52,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616285032] [2022-11-02 20:59:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:52,950 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-02 20:59:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616285032] [2022-11-02 20:59:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616285032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:52,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:52,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393762577] [2022-11-02 20:59:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:52,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:59:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:59:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:52,954 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:59:52,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-02 20:59:52,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:52,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:59:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:53,324 INFO L130 PetriNetUnfolder]: 191/741 cut-off events. [2022-11-02 20:59:53,324 INFO L131 PetriNetUnfolder]: For 126/134 co-relation queries the response was YES. [2022-11-02 20:59:53,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 741 events. 191/741 cut-off events. For 126/134 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3885 event pairs, 53 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1436. Up to 303 conditions per place. [2022-11-02 20:59:53,330 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 70 selfloop transitions, 25 changer transitions 4/180 dead transitions. [2022-11-02 20:59:53,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 180 transitions, 718 flow [2022-11-02 20:59:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:59:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 577 transitions. [2022-11-02 20:59:53,336 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8435672514619883 [2022-11-02 20:59:53,336 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 577 transitions. [2022-11-02 20:59:53,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 577 transitions. [2022-11-02 20:59:53,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:53,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 577 transitions. [2022-11-02 20:59:53,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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-02 20:59:53,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:53,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:53,343 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 392 flow. Second operand 6 states and 577 transitions. [2022-11-02 20:59:53,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 180 transitions, 718 flow [2022-11-02 20:59:53,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 180 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:59:53,354 INFO L231 Difference]: Finished difference. Result has 136 places, 157 transitions, 576 flow [2022-11-02 20:59:53,354 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=136, PETRI_TRANSITIONS=157} [2022-11-02 20:59:53,356 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-11-02 20:59:53,357 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 576 flow [2022-11-02 20:59:53,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-02 20:59:53,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:53,357 INFO L208 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] [2022-11-02 20:59:53,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:59:53,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 283971730, now seen corresponding path program 1 times [2022-11-02 20:59:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:53,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469503104] [2022-11-02 20:59:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:53,732 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-02 20:59:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469503104] [2022-11-02 20:59:53,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469503104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:53,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:53,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21765661] [2022-11-02 20:59:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:53,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:59:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:59:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:53,737 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-02 20:59:53,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 157 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-02 20:59:53,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:53,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-02 20:59:53,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:54,166 INFO L130 PetriNetUnfolder]: 232/930 cut-off events. [2022-11-02 20:59:54,166 INFO L131 PetriNetUnfolder]: For 443/451 co-relation queries the response was YES. [2022-11-02 20:59:54,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 930 events. 232/930 cut-off events. For 443/451 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5559 event pairs, 34 based on Foata normal form. 23/950 useless extension candidates. Maximal degree in co-relation 2329. Up to 305 conditions per place. [2022-11-02 20:59:54,174 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 84 selfloop transitions, 51 changer transitions 21/240 dead transitions. [2022-11-02 20:59:54,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 240 transitions, 1274 flow [2022-11-02 20:59:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:59:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2022-11-02 20:59:54,176 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8874269005847953 [2022-11-02 20:59:54,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2022-11-02 20:59:54,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2022-11-02 20:59:54,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:54,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2022-11-02 20:59:54,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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-02 20:59:54,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:54,183 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-02 20:59:54,183 INFO L175 Difference]: Start difference. First operand has 136 places, 157 transitions, 576 flow. Second operand 6 states and 607 transitions. [2022-11-02 20:59:54,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 240 transitions, 1274 flow [2022-11-02 20:59:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 240 transitions, 1260 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-11-02 20:59:54,193 INFO L231 Difference]: Finished difference. Result has 145 places, 191 transitions, 946 flow [2022-11-02 20:59:54,193 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=145, PETRI_TRANSITIONS=191} [2022-11-02 20:59:54,194 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2022-11-02 20:59:54,194 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 191 transitions, 946 flow [2022-11-02 20:59:54,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-02 20:59:54,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:54,195 INFO L208 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] [2022-11-02 20:59:54,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:59:54,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -84631545, now seen corresponding path program 1 times [2022-11-02 20:59:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589260106] [2022-11-02 20:59:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:54,771 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-02 20:59:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:54,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589260106] [2022-11-02 20:59:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589260106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:54,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:54,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:59:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664497786] [2022-11-02 20:59:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:54,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:54,780 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 114 [2022-11-02 20:59:54,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 191 transitions, 946 flow. Second operand has 11 states, 11 states have (on average 70.72727272727273) internal successors, (778), 11 states have internal predecessors, (778), 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-02 20:59:54,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:54,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 114 [2022-11-02 20:59:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:55,392 INFO L130 PetriNetUnfolder]: 272/1088 cut-off events. [2022-11-02 20:59:55,392 INFO L131 PetriNetUnfolder]: For 1120/1126 co-relation queries the response was YES. [2022-11-02 20:59:55,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 1088 events. 272/1088 cut-off events. For 1120/1126 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7186 event pairs, 46 based on Foata normal form. 13/1091 useless extension candidates. Maximal degree in co-relation 3145. Up to 387 conditions per place. [2022-11-02 20:59:55,404 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 128 selfloop transitions, 32 changer transitions 38/264 dead transitions. [2022-11-02 20:59:55,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 264 transitions, 1849 flow [2022-11-02 20:59:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:59:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:59:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1249 transitions. [2022-11-02 20:59:55,408 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6444788441692466 [2022-11-02 20:59:55,408 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1249 transitions. [2022-11-02 20:59:55,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1249 transitions. [2022-11-02 20:59:55,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:55,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1249 transitions. [2022-11-02 20:59:55,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.47058823529412) internal successors, (1249), 17 states have internal predecessors, (1249), 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-02 20:59:55,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-02 20:59:55,419 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-02 20:59:55,420 INFO L175 Difference]: Start difference. First operand has 145 places, 191 transitions, 946 flow. Second operand 17 states and 1249 transitions. [2022-11-02 20:59:55,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 264 transitions, 1849 flow [2022-11-02 20:59:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 264 transitions, 1795 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-11-02 20:59:55,440 INFO L231 Difference]: Finished difference. Result has 156 places, 189 transitions, 950 flow [2022-11-02 20:59:55,442 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=950, PETRI_PLACES=156, PETRI_TRANSITIONS=189} [2022-11-02 20:59:55,442 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-11-02 20:59:55,442 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 189 transitions, 950 flow [2022-11-02 20:59:55,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.72727272727273) internal successors, (778), 11 states have internal predecessors, (778), 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-02 20:59:55,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:55,443 INFO L208 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] [2022-11-02 20:59:55,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:59:55,444 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2124956034, now seen corresponding path program 1 times [2022-11-02 20:59:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:55,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009598373] [2022-11-02 20:59:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:55,980 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-02 20:59:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009598373] [2022-11-02 20:59:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009598373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:55,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:55,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:59:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323531978] [2022-11-02 20:59:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:55,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:55,984 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 114 [2022-11-02 20:59:55,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 189 transitions, 950 flow. Second operand has 11 states, 11 states have (on average 72.63636363636364) internal successors, (799), 11 states have internal predecessors, (799), 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-02 20:59:55,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:59:55,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 114 [2022-11-02 20:59:55,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:59:56,785 INFO L130 PetriNetUnfolder]: 225/835 cut-off events. [2022-11-02 20:59:56,786 INFO L131 PetriNetUnfolder]: For 1005/1012 co-relation queries the response was YES. [2022-11-02 20:59:56,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 835 events. 225/835 cut-off events. For 1005/1012 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4914 event pairs, 29 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 2738. Up to 163 conditions per place. [2022-11-02 20:59:56,795 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 124 selfloop transitions, 66 changer transitions 20/279 dead transitions. [2022-11-02 20:59:56,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 279 transitions, 1950 flow [2022-11-02 20:59:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:59:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:59:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1326 transitions. [2022-11-02 20:59:56,800 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2022-11-02 20:59:56,800 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1326 transitions. [2022-11-02 20:59:56,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1326 transitions. [2022-11-02 20:59:56,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:59:56,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1326 transitions. [2022-11-02 20:59:56,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 78.0) internal successors, (1326), 17 states have internal predecessors, (1326), 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-02 20:59:56,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-02 20:59:56,811 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-02 20:59:56,812 INFO L175 Difference]: Start difference. First operand has 156 places, 189 transitions, 950 flow. Second operand 17 states and 1326 transitions. [2022-11-02 20:59:56,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 279 transitions, 1950 flow [2022-11-02 20:59:56,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 279 transitions, 1820 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-11-02 20:59:56,831 INFO L231 Difference]: Finished difference. Result has 162 places, 202 transitions, 1206 flow [2022-11-02 20:59:56,831 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1206, PETRI_PLACES=162, PETRI_TRANSITIONS=202} [2022-11-02 20:59:56,832 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 45 predicate places. [2022-11-02 20:59:56,832 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 202 transitions, 1206 flow [2022-11-02 20:59:56,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.63636363636364) internal successors, (799), 11 states have internal predecessors, (799), 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-02 20:59:56,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:59:56,833 INFO L208 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-02 20:59:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:59:56,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-02 20:59:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash -539415416, now seen corresponding path program 1 times [2022-11-02 20:59:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926716312] [2022-11-02 20:59:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:59:56,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:59:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:59:56,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:59:56,932 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:59:56,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-11-02 20:59:56,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-11-02 20:59:56,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-11-02 20:59:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-11-02 20:59:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-11-02 20:59:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-11-02 20:59:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2022-11-02 20:59:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-11-02 20:59:56,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-11-02 20:59:56,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-11-02 20:59:56,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-11-02 20:59:56,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-11-02 20:59:56,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-11-02 20:59:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-11-02 20:59:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-11-02 20:59:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:59:56,938 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:56,946 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:59:56,946 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:59:57,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:59:57 BasicIcfg [2022-11-02 20:59:57,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:59:57,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:59:57,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:59:57,010 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:59:57,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:48" (3/4) ... [2022-11-02 20:59:57,013 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:59:57,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:59:57,014 INFO L158 Benchmark]: Toolchain (without parser) took 10196.45ms. Allocated memory was 113.2MB in the beginning and 237.0MB in the end (delta: 123.7MB). Free memory was 74.4MB in the beginning and 202.2MB in the end (delta: -127.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:57,015 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:57,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.21ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 60.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:59:57,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.23ms. Allocated memory is still 113.2MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:59:57,016 INFO L158 Benchmark]: Boogie Preprocessor took 55.54ms. Allocated memory is still 113.2MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:57,016 INFO L158 Benchmark]: RCFGBuilder took 612.29ms. Allocated memory is still 113.2MB. Free memory was 56.0MB in the beginning and 81.2MB in the end (delta: -25.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-11-02 20:59:57,017 INFO L158 Benchmark]: TraceAbstraction took 8623.54ms. Allocated memory was 113.2MB in the beginning and 237.0MB in the end (delta: 123.7MB). Free memory was 80.9MB in the beginning and 202.2MB in the end (delta: -121.3MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:57,017 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 237.0MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:57,019 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.25ms. Allocated memory is still 113.2MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.21ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 60.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.23ms. Allocated memory is still 113.2MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.54ms. Allocated memory is still 113.2MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.29ms. Allocated memory is still 113.2MB. Free memory was 56.0MB in the beginning and 81.2MB in the end (delta: -25.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8623.54ms. Allocated memory was 113.2MB in the beginning and 237.0MB in the end (delta: 123.7MB). Free memory was 80.9MB in the beginning and 202.2MB in the end (delta: -121.3MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 237.0MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={3:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [id={5:0}, m={3:0}, x={0:0}, y={0:0}] [L1235] 0 x = malloc(sizeof(int)) VAL [id={5:0}, m={3:0}, malloc(sizeof(int))={-2:0}, x={-2:0}, x = malloc(sizeof(int))=103, y={0:0}] [L1236] 0 y = malloc(sizeof(int)) VAL [id={5:0}, m={3:0}, malloc(sizeof(int))={-3:0}, x={-2:0}, y={-3:0}, y = malloc(sizeof(int))=104] [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, id={5:0}, m={3:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, x={-2:0}, y={-3:0}] [L1239] EXPR 0 *x VAL [arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 \read(*x) VAL [\read(*x)=106, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1239] 0 printf("%d\n",*x) VAL [\read(*x)=106, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1228] EXPR 1 *x VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [*x = 3=101, arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [*x = 3=101, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 \read(*y) VAL [*x = 3=101, \read(*y)=102, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] 0 printf("%d\n",*y) VAL [*y = 8=105, \read(*y)=102, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1235] * C: *y = 8 [1229] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 147 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1720 IncrementalHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 152 mSDtfsCounter, 1720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1206occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 1608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:59:57,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b5fd74-14b0-40b4-be38-d7d6e04a54c6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE