./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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 cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff --- 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:40:30,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:40:30,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:40:30,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:40:30,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:40:30,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:40:30,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:40:30,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:40:30,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:40:30,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:40:30,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:40:30,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:40:30,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:40:30,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:40:30,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:40:30,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:40:30,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:40:30,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:40:30,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:40:30,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:40:30,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:40:30,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:40:30,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:40:30,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:40:30,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:40:30,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:40:30,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:40:30,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:40:30,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:40:30,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:40:30,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:40:30,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:40:30,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:40:30,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:40:30,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:40:30,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:40:30,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:40:30,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:40:30,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:40:30,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:40:30,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:40:30,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:40:30,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:40:30,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:40:30,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:40:30,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:40:30,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:40:30,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:40:30,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:40:30,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:40:30,723 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:40:30,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:40:30,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:40:30,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:40:30,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:40:30,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:40:30,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:40:30,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:40:30,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:40:30,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:40:30,735 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:40:30,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:40:30,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:40:30,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:40:30,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:40:30,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:40:30,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:40:30,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:40:30,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:30,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:40:30,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:40:30,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:40:30,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:40:30,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:40:30,739 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:40:30,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:40:30,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:40:30,740 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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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 -> cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff [2022-11-02 20:40:31,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:40:31,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:40:31,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:40:31,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:40:31,151 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:40:31,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2022-11-02 20:40:31,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/data/97eb09056/c443cd9599844eb3babb217ce86c7490/FLAG028c10800 [2022-11-02 20:40:31,950 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:40:31,953 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2022-11-02 20:40:31,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/data/97eb09056/c443cd9599844eb3babb217ce86c7490/FLAG028c10800 [2022-11-02 20:40:32,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/data/97eb09056/c443cd9599844eb3babb217ce86c7490 [2022-11-02 20:40:32,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:40:32,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:40:32,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:32,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:40:32,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:40:32,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765d7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32, skipping insertion in model container [2022-11-02 20:40:32,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:40:32,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:40:32,700 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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i[30035,30048] [2022-11-02 20:40:32,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:32,729 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:40:32,769 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_daa1ab70-c31f-4376-a35d-5d3491bf2a25/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i[30035,30048] [2022-11-02 20:40:32,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:32,818 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:40:32,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32 WrapperNode [2022-11-02 20:40:32,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:32,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:32,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:40:32,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:40:32,829 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:40:32" (1/1) ... [2022-11-02 20:40:32,843 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:40:32" (1/1) ... [2022-11-02 20:40:32,868 INFO L138 Inliner]: procedures = 170, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2022-11-02 20:40:32,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:32,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:40:32,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:40:32,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:40:32,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:40:32,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:40:32,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:40:32,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:40:32,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (1/1) ... [2022-11-02 20:40:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:32,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:40:33,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:40:33,021 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-02 20:40:33,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-02 20:40:33,021 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 20:40:33,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 20:40:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:40:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:40:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:40:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:40:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:40:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:40:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:40:33,027 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:40:33,203 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:40:33,206 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:40:33,447 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:40:33,459 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:40:33,460 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:40:33,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:33 BoogieIcfgContainer [2022-11-02 20:40:33,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:40:33,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:40:33,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:40:33,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:40:33,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:40:32" (1/3) ... [2022-11-02 20:40:33,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d4050e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:33, skipping insertion in model container [2022-11-02 20:40:33,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:32" (2/3) ... [2022-11-02 20:40:33,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d4050e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:33, skipping insertion in model container [2022-11-02 20:40:33,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:33" (3/3) ... [2022-11-02 20:40:33,487 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2022-11-02 20:40:33,497 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:40:33,510 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:40:33,510 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-02 20:40:33,511 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:40:33,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:40:33,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 114 transitions, 238 flow [2022-11-02 20:40:33,755 INFO L130 PetriNetUnfolder]: 5/130 cut-off events. [2022-11-02 20:40:33,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:40:33,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 130 events. 5/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 171 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2022-11-02 20:40:33,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 114 transitions, 238 flow [2022-11-02 20:40:33,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 113 transitions, 234 flow [2022-11-02 20:40:33,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:40:33,824 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;@177a4f16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:40:33,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-02 20:40:33,837 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-11-02 20:40:33,841 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:40:33,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:33,843 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] [2022-11-02 20:40:33,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2109176308, now seen corresponding path program 1 times [2022-11-02 20:40:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686567785] [2022-11-02 20:40:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:34,158 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:40:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:34,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686567785] [2022-11-02 20:40:34,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686567785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:34,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:34,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047147968] [2022-11-02 20:40:34,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:34,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:34,236 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-11-02 20:40:34,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:40:34,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:34,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-11-02 20:40:34,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:34,363 INFO L130 PetriNetUnfolder]: 22/203 cut-off events. [2022-11-02 20:40:34,364 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:40:34,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 203 events. 22/203 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 629 event pairs, 21 based on Foata normal form. 28/196 useless extension candidates. Maximal degree in co-relation 210. Up to 57 conditions per place. [2022-11-02 20:40:34,368 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 14 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2022-11-02 20:40:34,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 256 flow [2022-11-02 20:40:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-11-02 20:40:34,384 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8742690058479532 [2022-11-02 20:40:34,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2022-11-02 20:40:34,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2022-11-02 20:40:34,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:34,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2022-11-02 20:40:34,394 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:40:34,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,402 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 234 flow. Second operand 3 states and 299 transitions. [2022-11-02 20:40:34,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 256 flow [2022-11-02 20:40:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:40:34,411 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 225 flow [2022-11-02 20:40:34,414 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2022-11-02 20:40:34,418 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2022-11-02 20:40:34,418 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 225 flow [2022-11-02 20:40:34,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:40:34,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:34,419 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] [2022-11-02 20:40:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:40:34,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1511755711, now seen corresponding path program 1 times [2022-11-02 20:40:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:34,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112305157] [2022-11-02 20:40:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:34,551 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:40:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112305157] [2022-11-02 20:40:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112305157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:34,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:34,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736747018] [2022-11-02 20:40:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:34,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:34,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-02 20:40:34,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 225 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:40:34,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:34,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-02 20:40:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:34,726 INFO L130 PetriNetUnfolder]: 22/265 cut-off events. [2022-11-02 20:40:34,727 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:40:34,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 265 events. 22/265 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1053 event pairs, 21 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 315. Up to 63 conditions per place. [2022-11-02 20:40:34,732 INFO L137 encePairwiseOnDemand]: 111/114 looper letters, 17 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-11-02 20:40:34,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 261 flow [2022-11-02 20:40:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-11-02 20:40:34,741 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-11-02 20:40:34,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2022-11-02 20:40:34,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2022-11-02 20:40:34,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:34,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2022-11-02 20:40:34,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:40:34,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,753 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 225 flow. Second operand 3 states and 290 transitions. [2022-11-02 20:40:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 261 flow [2022-11-02 20:40:34,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:34,760 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 223 flow [2022-11-02 20:40:34,762 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2022-11-02 20:40:34,763 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2022-11-02 20:40:34,763 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 223 flow [2022-11-02 20:40:34,764 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:40:34,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:34,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:34,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:40:34,766 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1111145419, now seen corresponding path program 1 times [2022-11-02 20:40:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:34,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439637428] [2022-11-02 20:40:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:34,898 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:40:34,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:34,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439637428] [2022-11-02 20:40:34,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439637428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:34,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280245660] [2022-11-02 20:40:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:34,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:34,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:34,907 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-11-02 20:40:34,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:40:34,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:34,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-11-02 20:40:34,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:34,963 INFO L130 PetriNetUnfolder]: 11/222 cut-off events. [2022-11-02 20:40:34,964 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:40:34,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 222 events. 11/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 772 event pairs, 10 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 233. Up to 32 conditions per place. [2022-11-02 20:40:34,966 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 1 changer transitions 0/102 dead transitions. [2022-11-02 20:40:34,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 239 flow [2022-11-02 20:40:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2022-11-02 20:40:34,969 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8625730994152047 [2022-11-02 20:40:34,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2022-11-02 20:40:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2022-11-02 20:40:34,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:34,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2022-11-02 20:40:34,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:40:34,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:34,980 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 223 flow. Second operand 3 states and 295 transitions. [2022-11-02 20:40:34,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 239 flow [2022-11-02 20:40:34,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 102 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:34,986 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 213 flow [2022-11-02 20:40:34,987 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2022-11-02 20:40:34,990 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -7 predicate places. [2022-11-02 20:40:34,990 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 213 flow [2022-11-02 20:40:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:40:34,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:34,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:40:34,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1102181646, now seen corresponding path program 1 times [2022-11-02 20:40:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:34,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981206207] [2022-11-02 20:40:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,152 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:40:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981206207] [2022-11-02 20:40:35,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981206207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274039176] [2022-11-02 20:40:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:35,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:35,162 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 114 [2022-11-02 20:40:35,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:40:35,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:35,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 114 [2022-11-02 20:40:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:35,240 INFO L130 PetriNetUnfolder]: 16/211 cut-off events. [2022-11-02 20:40:35,240 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:40:35,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 211 events. 16/211 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 638 event pairs, 4 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 233. Up to 29 conditions per place. [2022-11-02 20:40:35,244 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 14 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2022-11-02 20:40:35,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 262 flow [2022-11-02 20:40:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-02 20:40:35,247 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9005847953216374 [2022-11-02 20:40:35,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-02 20:40:35,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-02 20:40:35,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:35,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-02 20:40:35,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:35,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:35,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:35,255 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 213 flow. Second operand 3 states and 308 transitions. [2022-11-02 20:40:35,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 262 flow [2022-11-02 20:40:35,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:40:35,259 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 240 flow [2022-11-02 20:40:35,260 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2022-11-02 20:40:35,260 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2022-11-02 20:40:35,261 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 240 flow [2022-11-02 20:40:35,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:40:35,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:35,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:40:35,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash -504095292, now seen corresponding path program 1 times [2022-11-02 20:40:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:35,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633232505] [2022-11-02 20:40:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,354 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:40:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633232505] [2022-11-02 20:40:35,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633232505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655275501] [2022-11-02 20:40:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:35,359 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 114 [2022-11-02 20:40:35,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:40:35,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:35,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 114 [2022-11-02 20:40:35,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:35,452 INFO L130 PetriNetUnfolder]: 20/238 cut-off events. [2022-11-02 20:40:35,452 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2022-11-02 20:40:35,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 238 events. 20/238 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 804 event pairs, 8 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 314. Up to 45 conditions per place. [2022-11-02 20:40:35,455 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 19 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2022-11-02 20:40:35,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 110 transitions, 310 flow [2022-11-02 20:40:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2022-11-02 20:40:35,457 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8830409356725146 [2022-11-02 20:40:35,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2022-11-02 20:40:35,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2022-11-02 20:40:35,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:35,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2022-11-02 20:40:35,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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:40:35,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:35,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:35,461 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 240 flow. Second operand 3 states and 302 transitions. [2022-11-02 20:40:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 110 transitions, 310 flow [2022-11-02 20:40:35,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:35,464 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 264 flow [2022-11-02 20:40:35,465 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2022-11-02 20:40:35,465 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2022-11-02 20:40:35,465 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 264 flow [2022-11-02 20:40:35,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:40:35,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:35,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:35,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash 15130697, now seen corresponding path program 1 times [2022-11-02 20:40:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:35,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811494706] [2022-11-02 20:40:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,607 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:40:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811494706] [2022-11-02 20:40:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811494706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683302275] [2022-11-02 20:40:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:40:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:40:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:35,611 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-11-02 20:40:35,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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:40:35,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:35,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-11-02 20:40:35,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:35,686 INFO L130 PetriNetUnfolder]: 4/196 cut-off events. [2022-11-02 20:40:35,687 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:40:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 196 events. 4/196 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 539 event pairs, 1 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 228. Up to 14 conditions per place. [2022-11-02 20:40:35,688 INFO L137 encePairwiseOnDemand]: 110/114 looper letters, 11 selfloop transitions, 0 changer transitions 4/110 dead transitions. [2022-11-02 20:40:35,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 300 flow [2022-11-02 20:40:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:40:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:40:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-11-02 20:40:35,691 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8789473684210526 [2022-11-02 20:40:35,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2022-11-02 20:40:35,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2022-11-02 20:40:35,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:35,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2022-11-02 20:40:35,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:40:35,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:40:35,696 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:40:35,696 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 264 flow. Second operand 5 states and 501 transitions. [2022-11-02 20:40:35,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 300 flow [2022-11-02 20:40:35,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 110 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:35,700 INFO L231 Difference]: Finished difference. Result has 117 places, 106 transitions, 260 flow [2022-11-02 20:40:35,700 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=117, PETRI_TRANSITIONS=106} [2022-11-02 20:40:35,701 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 2 predicate places. [2022-11-02 20:40:35,701 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 106 transitions, 260 flow [2022-11-02 20:40:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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:40:35,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:35,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:40:35,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:40:35,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash 748380215, now seen corresponding path program 1 times [2022-11-02 20:40:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:35,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604928613] [2022-11-02 20:40:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:40:35,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:40:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:40:35,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:40:35,782 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:40:35,783 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-11-02 20:40:35,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-11-02 20:40:35,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-11-02 20:40:35,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-11-02 20:40:35,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-11-02 20:40:35,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-11-02 20:40:35,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2022-11-02 20:40:35,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-11-02 20:40:35,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-11-02 20:40:35,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-11-02 20:40:35,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2022-11-02 20:40:35,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2022-11-02 20:40:35,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-11-02 20:40:35,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-11-02 20:40:35,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-11-02 20:40:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:40:35,789 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,797 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:40:35,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:40:35,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:40:35 BasicIcfg [2022-11-02 20:40:35,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:40:35,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:40:35,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:40:35,877 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:40:35,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:33" (3/4) ... [2022-11-02 20:40:35,881 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:40:35,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:40:35,884 INFO L158 Benchmark]: Toolchain (without parser) took 3656.18ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 72.6MB in the beginning and 66.5MB in the end (delta: 6.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,886 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:40:35,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.71ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 82.1MB in the end (delta: -9.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.31ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,890 INFO L158 Benchmark]: Boogie Preprocessor took 47.97ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,891 INFO L158 Benchmark]: RCFGBuilder took 544.28ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 64.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,892 INFO L158 Benchmark]: TraceAbstraction took 2408.77ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 63.7MB in the beginning and 66.5MB in the end (delta: -2.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-02 20:40:35,892 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 142.6MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:40:35,899 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.35ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.71ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 82.1MB in the end (delta: -9.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.31ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.97ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.28ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 64.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2408.77ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 63.7MB in the beginning and 66.5MB in the end (delta: -2.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 142.6MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=0, t1={5:0}, t2={3:0}, x=0] [L702] 0 int i; VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=0, t1={5:0}, t2={3:0}, x=0] [L703] 0 x = 0 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=0, t1={5:0}, t2={3:0}, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=50, __VERIFIER_nondet_uint()=39, argc=50, argv={54:51}, argv={54:51}, n=39, n = __VERIFIER_nondet_uint()=53, t1={5:0}, t2={3:0}, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=39, t1={5:0}, t2={3:0}, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=39, n >= 20 && n < 40=1, t1={5:0}, t2={3:0}, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=39, n >= 20 && n < 40=1, t1={5:0}, t2={3:0}, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=39, n >= 20 && n < 40=1, t1={5:0}, t2={3:0}, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=39, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, n=39, pthread_create(&t1, 0, thr1, 0)=6, t1={5:0}, t2={3:0}, x=0] [L693] 1 x < n VAL [arg={0:0}, arg={0:0}, n=39, x=0] [L707] 0 i = 0 VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, i=0, n=39, t1={5:0}, t2={3:0}, x=0] [L707] 0 i < n VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, i=0, n=39, t1={5:0}, t2={3:0}, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=50, argc=50, argv={54:51}, argv={54:51}, i=0, n=39, t1={5:0}, t2={3:0}, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=50, arg={0:0}, argc=50, argv={54:51}, argv={54:51}, i=0, n=39, pthread_create(&t2, 0, thr2, 0)=7, t1={5:0}, t2={3:0}, x=0] [L696] 2 int t; VAL [arg={0:0}, arg={0:0}, n=39, x=0] [L697] 2 t = x VAL [arg={0:0}, arg={0:0}, n=39, t=0, x=0] [L698] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, n=39, t=0, x=1, x = t + 1=52] [L693] 1 x < n VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, n=39, t=0, x=1, x = t + 1=52] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x < n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 706]: 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 5 procedures, 143 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: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 64 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:40:36,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa1ab70-c31f-4376-a35d-5d3491bf2a25/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