./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/13_unverif.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/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_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/13_unverif.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/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_6320ab19-a297-410f-b848-d28234983fa4/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 ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 --- 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:50:00,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:00,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:00,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:00,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:00,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:00,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:00,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:00,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:00,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:00,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:00,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:00,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:00,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:00,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:00,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:00,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:00,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:00,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:00,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:00,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:00,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:00,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:00,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:00,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:00,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:00,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:00,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:00,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:00,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:00,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:00,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:00,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:00,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:00,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:00,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:00,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:00,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:00,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:00,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:00,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:00,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:50:00,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:00,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:00,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:00,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:00,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:00,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:00,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:00,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:00,996 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:00,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:00,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:50:00,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:50:00,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:00,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:50:00,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:00,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:00,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:00,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:00,999 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:50:00,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:50:00,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:00,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:00,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:01,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:01,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:01,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:01,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:01,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:01,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:01,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:01,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:01,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:01,002 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:01,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:01,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:01,002 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_6320ab19-a297-410f-b848-d28234983fa4/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_6320ab19-a297-410f-b848-d28234983fa4/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 -> ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 [2022-11-02 20:50:01,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:01,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:01,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:01,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:01,357 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:01,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-ext/13_unverif.i [2022-11-02 20:50:01,434 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/data/1b713fed0/d7eccbf0279043d1b44b231c452dcc4f/FLAGe36796eb6 [2022-11-02 20:50:01,986 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:01,987 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/sv-benchmarks/c/pthread-ext/13_unverif.i [2022-11-02 20:50:02,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/data/1b713fed0/d7eccbf0279043d1b44b231c452dcc4f/FLAGe36796eb6 [2022-11-02 20:50:02,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/data/1b713fed0/d7eccbf0279043d1b44b231c452dcc4f [2022-11-02 20:50:02,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:02,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:02,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:02,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:02,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:02,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:02" (1/1) ... [2022-11-02 20:50:02,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749a30c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:02, skipping insertion in model container [2022-11-02 20:50:02,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:02" (1/1) ... [2022-11-02 20:50:02,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:02,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:02,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/sv-benchmarks/c/pthread-ext/13_unverif.i[30213,30226] [2022-11-02 20:50:02,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:02,921 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:02,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/sv-benchmarks/c/pthread-ext/13_unverif.i[30213,30226] [2022-11-02 20:50:02,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:03,029 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:03,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03 WrapperNode [2022-11-02 20:50:03,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:03,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:03,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:03,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:03,038 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:50:03" (1/1) ... [2022-11-02 20:50:03,068 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:50:03" (1/1) ... [2022-11-02 20:50:03,087 INFO L138 Inliner]: procedures = 168, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2022-11-02 20:50:03,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:03,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:03,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:03,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:03,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:03,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:03,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:03,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:03,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (1/1) ... [2022-11-02 20:50:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:03,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:03,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 20:50:03,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 20:50:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:03,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:03,209 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:50:03,343 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:03,345 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:03,508 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:03,640 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:03,648 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:50:03,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:03 BoogieIcfgContainer [2022-11-02 20:50:03,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:03,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:03,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:03,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:03,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:02" (1/3) ... [2022-11-02 20:50:03,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663e51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:03, skipping insertion in model container [2022-11-02 20:50:03,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:03" (2/3) ... [2022-11-02 20:50:03,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663e51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:03, skipping insertion in model container [2022-11-02 20:50:03,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:03" (3/3) ... [2022-11-02 20:50:03,668 INFO L112 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2022-11-02 20:50:03,676 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:50:03,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:03,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-02 20:50:03,687 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:50:03,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:50:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 125 flow [2022-11-02 20:50:03,830 INFO L130 PetriNetUnfolder]: 4/71 cut-off events. [2022-11-02 20:50:03,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2022-11-02 20:50:03,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 60 transitions, 125 flow [2022-11-02 20:50:03,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 60 transitions, 125 flow [2022-11-02 20:50:03,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:03,856 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;@17770a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:03,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-02 20:50:03,866 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-02 20:50:03,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:03,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:03,867 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] [2022-11-02 20:50:03,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:50:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -117152001, now seen corresponding path program 1 times [2022-11-02 20:50:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197479] [2022-11-02 20:50:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:04,197 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:50:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:04,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197479] [2022-11-02 20:50:04,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:04,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:04,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:50:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38325658] [2022-11-02 20:50:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:04,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:50:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:50:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:50:04,285 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 60 [2022-11-02 20:50:04,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 125 flow. Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:04,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 60 [2022-11-02 20:50:04,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:04,370 INFO L130 PetriNetUnfolder]: 1/52 cut-off events. [2022-11-02 20:50:04,370 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:50:04,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 52 events. 1/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 4/50 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2022-11-02 20:50:04,374 INFO L137 encePairwiseOnDemand]: 54/60 looper letters, 2 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-11-02 20:50:04,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 105 flow [2022-11-02 20:50:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:50:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:50:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-11-02 20:50:04,396 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-11-02 20:50:04,397 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 110 transitions. [2022-11-02 20:50:04,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 110 transitions. [2022-11-02 20:50:04,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:04,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 110 transitions. [2022-11-02 20:50:04,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:50:04,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:50:04,422 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:50:04,424 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 125 flow. Second operand 2 states and 110 transitions. [2022-11-02 20:50:04,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 105 flow [2022-11-02 20:50:04,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 105 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:04,440 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 101 flow [2022-11-02 20:50:04,442 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=101, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-11-02 20:50:04,447 INFO L287 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2022-11-02 20:50:04,448 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 101 flow [2022-11-02 20:50:04,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:04,449 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] [2022-11-02 20:50:04,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:04,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:50:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -913915198, now seen corresponding path program 1 times [2022-11-02 20:50:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74312440] [2022-11-02 20:50:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:04,602 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:50:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74312440] [2022-11-02 20:50:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74312440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:04,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310226685] [2022-11-02 20:50:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:04,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:04,609 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 60 [2022-11-02 20:50:04,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:50:04,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:04,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 60 [2022-11-02 20:50:04,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:04,632 INFO L130 PetriNetUnfolder]: 1/51 cut-off events. [2022-11-02 20:50:04,633 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:50:04,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 51 events. 1/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2022-11-02 20:50:04,634 INFO L137 encePairwiseOnDemand]: 58/60 looper letters, 3 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2022-11-02 20:50:04,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 107 flow [2022-11-02 20:50:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-11-02 20:50:04,637 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8277777777777777 [2022-11-02 20:50:04,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2022-11-02 20:50:04,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2022-11-02 20:50:04,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:04,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2022-11-02 20:50:04,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:50:04,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:50:04,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:50:04,641 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 101 flow. Second operand 3 states and 149 transitions. [2022-11-02 20:50:04,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 107 flow [2022-11-02 20:50:04,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 107 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:04,644 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 101 flow [2022-11-02 20:50:04,644 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-11-02 20:50:04,645 INFO L287 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2022-11-02 20:50:04,645 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 101 flow [2022-11-02 20:50:04,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:50:04,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:04,646 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:04,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:04,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:50:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash 782452181, now seen corresponding path program 1 times [2022-11-02 20:50:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:04,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11507726] [2022-11-02 20:50:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:04,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:04,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:04,708 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:04,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2022-11-02 20:50:04,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-11-02 20:50:04,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-11-02 20:50:04,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-11-02 20:50:04,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-11-02 20:50:04,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-11-02 20:50:04,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2022-11-02 20:50:04,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-11-02 20:50:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-11-02 20:50:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-11-02 20:50:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-11-02 20:50:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-11-02 20:50:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-11-02 20:50:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-11-02 20:50:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-11-02 20:50:04,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:04,718 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-02 20:50:04,721 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:50:04,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 20:50:04,753 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:50:04,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 194 flow [2022-11-02 20:50:04,803 INFO L130 PetriNetUnfolder]: 7/115 cut-off events. [2022-11-02 20:50:04,804 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:50:04,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 7/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 252 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2022-11-02 20:50:04,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 91 transitions, 194 flow [2022-11-02 20:50:04,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 194 flow [2022-11-02 20:50:04,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:04,828 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;@17770a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:04,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-02 20:50:04,838 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-02 20:50:04,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:04,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:04,840 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] [2022-11-02 20:50:04,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:50:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1684835770, now seen corresponding path program 1 times [2022-11-02 20:50:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:04,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022692414] [2022-11-02 20:50:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:04,930 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:50:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:04,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022692414] [2022-11-02 20:50:04,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022692414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:04,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:04,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:50:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063070432] [2022-11-02 20:50:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:04,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:50:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:50:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:50:04,940 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2022-11-02 20:50:04,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:50:04,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:04,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2022-11-02 20:50:04,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:04,990 INFO L130 PetriNetUnfolder]: 6/132 cut-off events. [2022-11-02 20:50:04,990 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-02 20:50:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 132 events. 6/132 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 373 event pairs, 2 based on Foata normal form. 11/118 useless extension candidates. Maximal degree in co-relation 84. Up to 9 conditions per place. [2022-11-02 20:50:04,993 INFO L137 encePairwiseOnDemand]: 81/91 looper letters, 4 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2022-11-02 20:50:04,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 168 flow [2022-11-02 20:50:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:50:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:50:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2022-11-02 20:50:04,996 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9010989010989011 [2022-11-02 20:50:04,996 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 164 transitions. [2022-11-02 20:50:04,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 164 transitions. [2022-11-02 20:50:04,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:04,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 164 transitions. [2022-11-02 20:50:04,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:50:04,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:50:05,000 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:50:05,000 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 194 flow. Second operand 2 states and 164 transitions. [2022-11-02 20:50:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 168 flow [2022-11-02 20:50:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 166 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:05,003 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 158 flow [2022-11-02 20:50:05,003 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2022-11-02 20:50:05,004 INFO L287 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2022-11-02 20:50:05,005 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 158 flow [2022-11-02 20:50:05,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:50:05,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,005 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] [2022-11-02 20:50:05,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:05,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:50:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash -75483683, now seen corresponding path program 1 times [2022-11-02 20:50:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945119066] [2022-11-02 20:50:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:05,074 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:50:05,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:05,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945119066] [2022-11-02 20:50:05,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945119066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:05,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:05,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241998369] [2022-11-02 20:50:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:05,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:05,078 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2022-11-02 20:50:05,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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:50:05,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:05,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2022-11-02 20:50:05,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:05,169 INFO L130 PetriNetUnfolder]: 24/279 cut-off events. [2022-11-02 20:50:05,169 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:50:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 279 events. 24/279 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1407 event pairs, 5 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 339. Up to 30 conditions per place. [2022-11-02 20:50:05,173 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 11 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2022-11-02 20:50:05,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 211 flow [2022-11-02 20:50:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-11-02 20:50:05,176 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8278388278388278 [2022-11-02 20:50:05,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 226 transitions. [2022-11-02 20:50:05,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 226 transitions. [2022-11-02 20:50:05,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:05,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 226 transitions. [2022-11-02 20:50:05,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:50:05,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,181 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 158 flow. Second operand 3 states and 226 transitions. [2022-11-02 20:50:05,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 211 flow [2022-11-02 20:50:05,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:05,185 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 210 flow [2022-11-02 20:50:05,186 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2022-11-02 20:50:05,186 INFO L287 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2022-11-02 20:50:05,187 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 210 flow [2022-11-02 20:50:05,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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:50:05,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,188 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] [2022-11-02 20:50:05,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:05,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:50:05,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1828806496, now seen corresponding path program 1 times [2022-11-02 20:50:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392563351] [2022-11-02 20:50:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:05,239 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:50:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:05,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392563351] [2022-11-02 20:50:05,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392563351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:05,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:05,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635781403] [2022-11-02 20:50:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:05,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:05,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:05,243 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 91 [2022-11-02 20:50:05,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:50:05,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:05,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 91 [2022-11-02 20:50:05,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:05,424 INFO L130 PetriNetUnfolder]: 149/587 cut-off events. [2022-11-02 20:50:05,425 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-02 20:50:05,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 587 events. 149/587 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3246 event pairs, 40 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 1032. Up to 200 conditions per place. [2022-11-02 20:50:05,432 INFO L137 encePairwiseOnDemand]: 77/91 looper letters, 31 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2022-11-02 20:50:05,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 339 flow [2022-11-02 20:50:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-02 20:50:05,435 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7838827838827839 [2022-11-02 20:50:05,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-02 20:50:05,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-02 20:50:05,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:05,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-02 20:50:05,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,439 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 210 flow. Second operand 3 states and 214 transitions. [2022-11-02 20:50:05,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 339 flow [2022-11-02 20:50:05,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:05,445 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 286 flow [2022-11-02 20:50:05,445 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2022-11-02 20:50:05,446 INFO L287 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2022-11-02 20:50:05,447 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 286 flow [2022-11-02 20:50:05,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:50:05,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,448 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] [2022-11-02 20:50:05,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:05,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:50:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1160283043, now seen corresponding path program 1 times [2022-11-02 20:50:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808106555] [2022-11-02 20:50:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:05,497 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:50:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:05,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808106555] [2022-11-02 20:50:05,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808106555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:05,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:05,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589280330] [2022-11-02 20:50:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:05,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:05,501 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 91 [2022-11-02 20:50:05,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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:50:05,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:05,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 91 [2022-11-02 20:50:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:05,715 INFO L130 PetriNetUnfolder]: 181/668 cut-off events. [2022-11-02 20:50:05,716 INFO L131 PetriNetUnfolder]: For 376/399 co-relation queries the response was YES. [2022-11-02 20:50:05,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 668 events. 181/668 cut-off events. For 376/399 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3825 event pairs, 66 based on Foata normal form. 6/588 useless extension candidates. Maximal degree in co-relation 1492. Up to 333 conditions per place. [2022-11-02 20:50:05,725 INFO L137 encePairwiseOnDemand]: 84/91 looper letters, 44 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2022-11-02 20:50:05,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 465 flow [2022-11-02 20:50:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-11-02 20:50:05,731 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2022-11-02 20:50:05,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 203 transitions. [2022-11-02 20:50:05,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions. [2022-11-02 20:50:05,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:05,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions. [2022-11-02 20:50:05,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:50:05,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:50:05,736 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 286 flow. Second operand 3 states and 203 transitions. [2022-11-02 20:50:05,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 107 transitions, 465 flow [2022-11-02 20:50:05,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:05,751 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 342 flow [2022-11-02 20:50:05,752 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2022-11-02 20:50:05,756 INFO L287 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2022-11-02 20:50:05,756 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 342 flow [2022-11-02 20:50:05,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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:50:05,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,757 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:50:05,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:50:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2040095879, now seen corresponding path program 1 times [2022-11-02 20:50:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760118031] [2022-11-02 20:50:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:05,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:05,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:05,833 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:05,833 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2022-11-02 20:50:05,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-02 20:50:05,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-02 20:50:05,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-02 20:50:05,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-02 20:50:05,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-02 20:50:05,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-02 20:50:05,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-02 20:50:05,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-02 20:50:05,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-02 20:50:05,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2022-11-02 20:50:05,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-02 20:50:05,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-02 20:50:05,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-02 20:50:05,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-02 20:50:05,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-02 20:50:05,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-02 20:50:05,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-02 20:50:05,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-02 20:50:05,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-02 20:50:05,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-02 20:50:05,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-02 20:50:05,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:50:05,840 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-02 20:50:05,840 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:50:05,840 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-02 20:50:05,906 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:50:05,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 265 flow [2022-11-02 20:50:05,954 INFO L130 PetriNetUnfolder]: 10/159 cut-off events. [2022-11-02 20:50:05,954 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:50:05,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 159 events. 10/159 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 426 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2022-11-02 20:50:05,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 122 transitions, 265 flow [2022-11-02 20:50:05,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 265 flow [2022-11-02 20:50:05,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:05,973 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;@17770a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:05,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-02 20:50:05,978 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-11-02 20:50:05,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:05,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,978 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] [2022-11-02 20:50:05,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-11-02 20:50:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1126904213, now seen corresponding path program 1 times [2022-11-02 20:50:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182625074] [2022-11-02 20:50:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:06,013 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:50:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:06,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182625074] [2022-11-02 20:50:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182625074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:06,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:06,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:50:06,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418116522] [2022-11-02 20:50:06,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:06,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:50:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:06,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:50:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:50:06,018 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-02 20:50:06,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 265 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:50:06,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:06,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-02 20:50:06,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:06,084 INFO L130 PetriNetUnfolder]: 21/310 cut-off events. [2022-11-02 20:50:06,084 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-02 20:50:06,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 310 events. 21/310 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1534 event pairs, 10 based on Foata normal form. 26/267 useless extension candidates. Maximal degree in co-relation 190. Up to 25 conditions per place. [2022-11-02 20:50:06,089 INFO L137 encePairwiseOnDemand]: 108/122 looper letters, 6 selfloop transitions, 0 changer transitions 0/100 dead transitions. [2022-11-02 20:50:06,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 233 flow [2022-11-02 20:50:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:50:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:50:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 218 transitions. [2022-11-02 20:50:06,091 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8934426229508197 [2022-11-02 20:50:06,091 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 218 transitions. [2022-11-02 20:50:06,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 218 transitions. [2022-11-02 20:50:06,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:06,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 218 transitions. [2022-11-02 20:50:06,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:06,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:50:06,095 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:50:06,095 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 265 flow. Second operand 2 states and 218 transitions. [2022-11-02 20:50:06,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 233 flow [2022-11-02 20:50:06,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 227 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:06,099 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 215 flow [2022-11-02 20:50:06,100 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=215, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2022-11-02 20:50:06,101 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, -17 predicate places. [2022-11-02 20:50:06,101 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 215 flow [2022-11-02 20:50:06,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:50:06,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:06,102 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] [2022-11-02 20:50:06,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:50:06,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-11-02 20:50:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 623206905, now seen corresponding path program 1 times [2022-11-02 20:50:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:06,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251799591] [2022-11-02 20:50:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:06,162 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:50:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251799591] [2022-11-02 20:50:06,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251799591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:06,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:06,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960846213] [2022-11-02 20:50:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:06,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:06,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:06,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2022-11-02 20:50:06,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:50:06,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:06,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2022-11-02 20:50:06,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:06,498 INFO L130 PetriNetUnfolder]: 274/1704 cut-off events. [2022-11-02 20:50:06,498 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2022-11-02 20:50:06,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 1704 events. 274/1704 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15782 event pairs, 67 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 2201. Up to 271 conditions per place. [2022-11-02 20:50:06,519 INFO L137 encePairwiseOnDemand]: 110/122 looper letters, 17 selfloop transitions, 9 changer transitions 0/111 dead transitions. [2022-11-02 20:50:06,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 299 flow [2022-11-02 20:50:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-11-02 20:50:06,522 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8169398907103825 [2022-11-02 20:50:06,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2022-11-02 20:50:06,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2022-11-02 20:50:06,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:06,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2022-11-02 20:50:06,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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:50:06,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:06,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:06,526 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 215 flow. Second operand 3 states and 299 transitions. [2022-11-02 20:50:06,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 299 flow [2022-11-02 20:50:06,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 299 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:06,530 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 293 flow [2022-11-02 20:50:06,530 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2022-11-02 20:50:06,534 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2022-11-02 20:50:06,534 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 293 flow [2022-11-02 20:50:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:50:06,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:06,535 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] [2022-11-02 20:50:06,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:50:06,535 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-11-02 20:50:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1186248962, now seen corresponding path program 1 times [2022-11-02 20:50:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:06,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214441279] [2022-11-02 20:50:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:06,610 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:50:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214441279] [2022-11-02 20:50:06,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214441279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:06,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:06,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515576011] [2022-11-02 20:50:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:06,613 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 122 [2022-11-02 20:50:06,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:50:06,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:06,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 122 [2022-11-02 20:50:06,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:08,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][105], [38#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 130#(= |#race~r~0| 0), 136#(= |#race~s~0| 0), 111#L701-1true, Black: 128#true, 59#L699-1true, thr1Thread1of3ForFork0InUse, 39#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 125#true]) [2022-11-02 20:50:08,621 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:50:08,621 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:50:08,621 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:50:08,621 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:50:08,657 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][105], [38#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 136#(= |#race~s~0| 0), 130#(= |#race~r~0| 0), 59#L699-1true, Black: 128#true, thr1Thread1of3ForFork0InUse, 39#L709-4true, thr1Thread2of3ForFork0InUse, 6#L701-2true, thr1Thread3of3ForFork0InUse, 125#true]) [2022-11-02 20:50:08,658 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:50:08,658 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:08,658 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:08,658 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:08,826 INFO L130 PetriNetUnfolder]: 5083/12066 cut-off events. [2022-11-02 20:50:08,827 INFO L131 PetriNetUnfolder]: For 2442/2442 co-relation queries the response was YES. [2022-11-02 20:50:08,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22910 conditions, 12066 events. 5083/12066 cut-off events. For 2442/2442 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 115645 event pairs, 1583 based on Foata normal form. 0/9655 useless extension candidates. Maximal degree in co-relation 22902. Up to 5317 conditions per place. [2022-11-02 20:50:08,998 INFO L137 encePairwiseOnDemand]: 101/122 looper letters, 50 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2022-11-02 20:50:08,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 138 transitions, 509 flow [2022-11-02 20:50:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2022-11-02 20:50:09,000 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76775956284153 [2022-11-02 20:50:09,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2022-11-02 20:50:09,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2022-11-02 20:50:09,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:09,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2022-11-02 20:50:09,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:50:09,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:09,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:09,004 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 293 flow. Second operand 3 states and 281 transitions. [2022-11-02 20:50:09,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 138 transitions, 509 flow [2022-11-02 20:50:09,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 138 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:09,011 INFO L231 Difference]: Finished difference. Result has 111 places, 124 transitions, 407 flow [2022-11-02 20:50:09,011 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=111, PETRI_TRANSITIONS=124} [2022-11-02 20:50:09,012 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2022-11-02 20:50:09,012 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 124 transitions, 407 flow [2022-11-02 20:50:09,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:50:09,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:09,013 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] [2022-11-02 20:50:09,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:50:09,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-11-02 20:50:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 85113537, now seen corresponding path program 1 times [2022-11-02 20:50:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:09,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332535806] [2022-11-02 20:50:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:09,104 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:50:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332535806] [2022-11-02 20:50:09,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332535806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:09,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:09,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904408048] [2022-11-02 20:50:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:09,107 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 122 [2022-11-02 20:50:09,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 124 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:50:09,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:09,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 122 [2022-11-02 20:50:09,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:11,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][101], [136#(= |#race~s~0| 0), 38#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 140#true, 59#L699-1true, Black: 128#true, thr1Thread1of3ForFork0InUse, 39#L709-4true, 6#L701-2true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 134#true, 125#true]) [2022-11-02 20:50:11,319 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:50:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 20:50:11,694 INFO L130 PetriNetUnfolder]: 6366/14502 cut-off events. [2022-11-02 20:50:11,694 INFO L131 PetriNetUnfolder]: For 9504/10313 co-relation queries the response was YES. [2022-11-02 20:50:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35817 conditions, 14502 events. 6366/14502 cut-off events. For 9504/10313 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 138799 event pairs, 2637 based on Foata normal form. 115/12476 useless extension candidates. Maximal degree in co-relation 35808. Up to 9061 conditions per place. [2022-11-02 20:50:11,895 INFO L137 encePairwiseOnDemand]: 112/122 looper letters, 73 selfloop transitions, 16 changer transitions 0/160 dead transitions. [2022-11-02 20:50:11,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 160 transitions, 743 flow [2022-11-02 20:50:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-02 20:50:11,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2022-11-02 20:50:11,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-02 20:50:11,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-02 20:50:11,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:11,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-02 20:50:11,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:11,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:50:11,901 INFO L175 Difference]: Start difference. First operand has 111 places, 124 transitions, 407 flow. Second operand 3 states and 270 transitions. [2022-11-02 20:50:11,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 160 transitions, 743 flow [2022-11-02 20:50:11,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 160 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:11,917 INFO L231 Difference]: Finished difference. Result has 113 places, 138 transitions, 523 flow [2022-11-02 20:50:11,918 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=113, PETRI_TRANSITIONS=138} [2022-11-02 20:50:11,919 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, -9 predicate places. [2022-11-02 20:50:11,920 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 138 transitions, 523 flow [2022-11-02 20:50:11,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:50:11,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:11,920 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:11,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:50:11,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-11-02 20:50:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 695657233, now seen corresponding path program 1 times [2022-11-02 20:50:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:11,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655629840] [2022-11-02 20:50:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:11,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:11,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:12,000 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:12,001 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2022-11-02 20:50:12,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2022-11-02 20:50:12,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2022-11-02 20:50:12,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2022-11-02 20:50:12,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2022-11-02 20:50:12,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2022-11-02 20:50:12,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2022-11-02 20:50:12,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2022-11-02 20:50:12,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 29 remaining) [2022-11-02 20:50:12,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2022-11-02 20:50:12,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2022-11-02 20:50:12,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2022-11-02 20:50:12,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2022-11-02 20:50:12,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2022-11-02 20:50:12,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2022-11-02 20:50:12,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2022-11-02 20:50:12,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2022-11-02 20:50:12,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2022-11-02 20:50:12,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2022-11-02 20:50:12,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2022-11-02 20:50:12,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2022-11-02 20:50:12,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2022-11-02 20:50:12,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2022-11-02 20:50:12,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2022-11-02 20:50:12,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2022-11-02 20:50:12,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2022-11-02 20:50:12,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2022-11-02 20:50:12,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2022-11-02 20:50:12,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2022-11-02 20:50:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:50:12,007 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-02 20:50:12,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-02 20:50:12,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:50:12,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:50:12 BasicIcfg [2022-11-02 20:50:12,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:50:12,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:50:12,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:50:12,089 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:50:12,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:03" (3/4) ... [2022-11-02 20:50:12,093 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:50:12,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:50:12,095 INFO L158 Benchmark]: Toolchain (without parser) took 9801.20ms. Allocated memory was 113.2MB in the beginning and 543.2MB in the end (delta: 429.9MB). Free memory was 69.2MB in the beginning and 253.0MB in the end (delta: -183.8MB). Peak memory consumption was 244.6MB. Max. memory is 16.1GB. [2022-11-02 20:50:12,095 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:12,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.76ms. Allocated memory is still 113.2MB. Free memory was 69.0MB in the beginning and 79.3MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:50:12,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.78ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:12,097 INFO L158 Benchmark]: Boogie Preprocessor took 26.05ms. Allocated memory is still 113.2MB. Free memory was 77.2MB in the beginning and 76.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:12,097 INFO L158 Benchmark]: RCFGBuilder took 536.38ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 60.9MB in the end (delta: 15.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:50:12,098 INFO L158 Benchmark]: TraceAbstraction took 8432.47ms. Allocated memory was 113.2MB in the beginning and 543.2MB in the end (delta: 429.9MB). Free memory was 60.5MB in the beginning and 253.0MB in the end (delta: -192.5MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB. [2022-11-02 20:50:12,098 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 543.2MB. Free memory is still 253.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:12,101 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.32ms. Allocated memory is still 113.2MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.76ms. Allocated memory is still 113.2MB. Free memory was 69.0MB in the beginning and 79.3MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.78ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.05ms. Allocated memory is still 113.2MB. Free memory was 77.2MB in the beginning and 76.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 536.38ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 60.9MB in the end (delta: 15.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8432.47ms. Allocated memory was 113.2MB in the beginning and 543.2MB in the end (delta: 429.9MB). Free memory was 60.5MB in the beginning and 253.0MB in the end (delta: -192.5MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 543.2MB. Free memory is still 253.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 698]: Data race detected Data race detected The following path leads to a data race: [L688] 0 unsigned int r = 0; VAL [r=0] [L689] 0 unsigned int s = 0; VAL [r=0, s=0] [L707] 0 pthread_t t; VAL [r=0, s=0, t={3:0}] [L708] COND TRUE 0 1 VAL [r=0, s=0, t={3:0}] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [pthread_create(&t, 0, thr1, 0)=-1, r=0, s=0, t={3:0}] [L696] 1 unsigned int l = 0; VAL [arg={0:0}, arg={0:0}, l=0, r=0, s=0] [L708] COND TRUE 0 1 VAL [r=0, s=0, t={3:0}] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [pthread_create(&t, 0, thr1, 0)=0, r=0, s=0, t={3:0}] [L697] CALL 1 __VERIFIER_atomic_inc_r() [L692] EXPR 1 r!=-1 [L692] CALL 1 assume_abort_if_not(r!=-1) [L3] COND FALSE 1 !(!cond) [L692] RET 1 assume_abort_if_not(r!=-1) [L693] EXPR 1 r + 1 [L693] 1 r = r + 1 [L697] RET 1 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [arg={0:0}, arg={0:0}, l=0, r=1, s=0] [L696] 2 unsigned int l = 0; VAL [arg={0:0}, arg={0:0}, l=0, r=1, s=0] [L697] CALL 2 __VERIFIER_atomic_inc_r() [L692] EXPR 2 r!=-1 [L692] CALL 2 assume_abort_if_not(r!=-1) [L3] COND FALSE 2 !(!cond) [L692] RET 2 assume_abort_if_not(r!=-1) [L693] EXPR 2 r + 1 [L693] 2 r = r + 1 [L697] RET 2 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [arg={0:0}, arg={0:0}, l=0, r=2, s=0] Now there is a data race on ~r~0 between C: r = r + 1 [693] and C: r == 1 [698] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 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: 0.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 116 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 44 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 145 locations, 29 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: 6.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 66 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:50:12,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6320ab19-a297-410f-b848-d28234983fa4/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