./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_safe-7.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_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/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_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_safe-7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/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_9ec35451-9c8e-4d21-9854-53704aed4877/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 1723883ecbdb95d71ea3ec2c746fab3b92c3a077cf232c2150d4112b37a05f98 --- 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:53:08,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:08,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:08,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:09,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:09,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:09,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:09,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:09,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:09,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:09,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:09,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:09,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:09,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:09,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:09,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:09,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:09,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:09,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:09,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:09,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:09,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:09,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:09,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:09,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:09,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:09,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:09,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:09,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:09,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:09,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:09,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:09,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:09,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:09,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:09,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:09,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:09,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:09,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:09,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:09,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:09,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:53:09,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:09,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:09,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:09,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:09,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:09,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:09,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:09,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:09,096 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:09,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:09,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:09,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:53:09,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:09,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:09,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:09,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:09,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:09,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:09,099 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:53:09,100 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:09,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:09,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:09,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:09,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:09,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:09,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:09,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:09,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:09,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:09,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:09,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:09,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:09,104 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:09,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:09,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:09,105 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_9ec35451-9c8e-4d21-9854-53704aed4877/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_9ec35451-9c8e-4d21-9854-53704aed4877/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 -> 1723883ecbdb95d71ea3ec2c746fab3b92c3a077cf232c2150d4112b37a05f98 [2022-11-02 20:53:09,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:09,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:09,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:09,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:09,388 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:09,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/fib_safe-7.i [2022-11-02 20:53:09,470 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/data/142d03d35/d4da66baf67845bd8f132f07ba8aa7d5/FLAG853bf19e7 [2022-11-02 20:53:10,179 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:10,180 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/sv-benchmarks/c/pthread/fib_safe-7.i [2022-11-02 20:53:10,199 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/data/142d03d35/d4da66baf67845bd8f132f07ba8aa7d5/FLAG853bf19e7 [2022-11-02 20:53:10,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/data/142d03d35/d4da66baf67845bd8f132f07ba8aa7d5 [2022-11-02 20:53:10,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:10,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:10,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:10,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:10,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:10,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:10" (1/1) ... [2022-11-02 20:53:10,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4b8148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:10, skipping insertion in model container [2022-11-02 20:53:10,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:10" (1/1) ... [2022-11-02 20:53:10,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:10,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:10,976 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_9ec35451-9c8e-4d21-9854-53704aed4877/sv-benchmarks/c/pthread/fib_safe-7.i[30813,30826] [2022-11-02 20:53:10,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:10,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:11,071 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_9ec35451-9c8e-4d21-9854-53704aed4877/sv-benchmarks/c/pthread/fib_safe-7.i[30813,30826] [2022-11-02 20:53:11,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:11,116 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:11,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11 WrapperNode [2022-11-02 20:53:11,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:11,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:11,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:11,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:11,126 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:53:11" (1/1) ... [2022-11-02 20:53:11,165 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:53:11" (1/1) ... [2022-11-02 20:53:11,206 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-02 20:53:11,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:11,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:11,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:11,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:11,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:11,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:11,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:11,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:11,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:11,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:11,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:11,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:53:11,365 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:53:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:53:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:53:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:53:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:53:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:11,369 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:53:11,547 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:11,550 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:12,044 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:12,118 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:12,119 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:53:12,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12 BoogieIcfgContainer [2022-11-02 20:53:12,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:12,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:12,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:12,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:12,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:10" (1/3) ... [2022-11-02 20:53:12,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277de80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:12, skipping insertion in model container [2022-11-02 20:53:12,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (2/3) ... [2022-11-02 20:53:12,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277de80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:12, skipping insertion in model container [2022-11-02 20:53:12,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12" (3/3) ... [2022-11-02 20:53:12,170 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-7.i [2022-11-02 20:53:12,200 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:53:12,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:12,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 20:53:12,218 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:53:12,305 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:53:12,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-02 20:53:12,457 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-02 20:53:12,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:12,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 364 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-11-02 20:53:12,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 396 flow [2022-11-02 20:53:12,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 388 flow [2022-11-02 20:53:12,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:12,495 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;@4df42ae4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:12,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-02 20:53:12,505 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-02 20:53:12,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:12,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:12,507 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] [2022-11-02 20:53:12,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377174, now seen corresponding path program 1 times [2022-11-02 20:53:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895159941] [2022-11-02 20:53:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:12,815 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:53:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:12,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895159941] [2022-11-02 20:53:12,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895159941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:12,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:12,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:53:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448368488] [2022-11-02 20:53:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:53:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:12,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:53:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:53:12,882 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 193 [2022-11-02 20:53:12,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 191 transitions, 388 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:53:12,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:12,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 193 [2022-11-02 20:53:12,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:13,055 INFO L130 PetriNetUnfolder]: 9/295 cut-off events. [2022-11-02 20:53:13,055 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:53:13,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 295 events. 9/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 957 event pairs, 2 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 274. Up to 11 conditions per place. [2022-11-02 20:53:13,062 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2022-11-02 20:53:13,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 374 flow [2022-11-02 20:53:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:53:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:53:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-11-02 20:53:13,079 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9481865284974094 [2022-11-02 20:53:13,080 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-11-02 20:53:13,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-11-02 20:53:13,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:13,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-11-02 20:53:13,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:13,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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:53:13,097 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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:53:13,099 INFO L175 Difference]: Start difference. First operand has 190 places, 191 transitions, 388 flow. Second operand 2 states and 366 transitions. [2022-11-02 20:53:13,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 374 flow [2022-11-02 20:53:13,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:13,120 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 360 flow [2022-11-02 20:53:13,128 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2022-11-02 20:53:13,133 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -10 predicate places. [2022-11-02 20:53:13,133 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 360 flow [2022-11-02 20:53:13,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:53:13,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:13,135 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] [2022-11-02 20:53:13,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:13,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -929261081, now seen corresponding path program 1 times [2022-11-02 20:53:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:13,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780749772] [2022-11-02 20:53:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:13,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780749772] [2022-11-02 20:53:13,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780749772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:13,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:13,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932564096] [2022-11-02 20:53:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:13,355 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 20:53:13,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:53:13,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:13,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 20:53:13,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:13,572 INFO L130 PetriNetUnfolder]: 48/393 cut-off events. [2022-11-02 20:53:13,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:13,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 393 events. 48/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1840 event pairs, 14 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 511. Up to 77 conditions per place. [2022-11-02 20:53:13,587 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-11-02 20:53:13,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 406 flow [2022-11-02 20:53:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-02 20:53:13,595 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2022-11-02 20:53:13,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-02 20:53:13,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-02 20:53:13,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:13,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-02 20:53:13,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:53:13,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:13,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:13,607 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 360 flow. Second operand 3 states and 502 transitions. [2022-11-02 20:53:13,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 406 flow [2022-11-02 20:53:13,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 179 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:53:13,617 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 362 flow [2022-11-02 20:53:13,617 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2022-11-02 20:53:13,619 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -9 predicate places. [2022-11-02 20:53:13,619 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 362 flow [2022-11-02 20:53:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:53:13,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:13,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:13,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:13,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837375, now seen corresponding path program 1 times [2022-11-02 20:53:13,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:13,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416193125] [2022-11-02 20:53:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,762 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:53:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416193125] [2022-11-02 20:53:13,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416193125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:13,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:13,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580463047] [2022-11-02 20:53:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:13,767 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 20:53:13,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:53:13,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:13,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 20:53:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:13,882 INFO L130 PetriNetUnfolder]: 34/261 cut-off events. [2022-11-02 20:53:13,882 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:53:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 261 events. 34/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 975 event pairs, 11 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 354. Up to 34 conditions per place. [2022-11-02 20:53:13,888 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2022-11-02 20:53:13,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 398 flow [2022-11-02 20:53:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-02 20:53:13,890 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-02 20:53:13,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-02 20:53:13,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-02 20:53:13,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:13,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-02 20:53:13,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:53:13,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:13,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:13,895 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 362 flow. Second operand 3 states and 505 transitions. [2022-11-02 20:53:13,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 398 flow [2022-11-02 20:53:13,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 177 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:13,900 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 358 flow [2022-11-02 20:53:13,901 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-11-02 20:53:13,901 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-02 20:53:13,902 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 358 flow [2022-11-02 20:53:13,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:53:13,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:13,902 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] [2022-11-02 20:53:13,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:13,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash -418600324, now seen corresponding path program 1 times [2022-11-02 20:53:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214991745] [2022-11-02 20:53:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:13,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,962 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:53:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214991745] [2022-11-02 20:53:13,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214991745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:13,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:13,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410237346] [2022-11-02 20:53:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:13,966 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 20:53:13,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:53:13,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:13,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 20:53:13,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:14,086 INFO L130 PetriNetUnfolder]: 22/303 cut-off events. [2022-11-02 20:53:14,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:14,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 303 events. 22/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1172 event pairs, 13 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2022-11-02 20:53:14,092 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-02 20:53:14,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 398 flow [2022-11-02 20:53:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-11-02 20:53:14,094 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8652849740932642 [2022-11-02 20:53:14,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-11-02 20:53:14,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-11-02 20:53:14,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:14,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-11-02 20:53:14,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 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:53:14,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,103 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 358 flow. Second operand 3 states and 501 transitions. [2022-11-02 20:53:14,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 398 flow [2022-11-02 20:53:14,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 175 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:14,108 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2022-11-02 20:53:14,108 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-11-02 20:53:14,110 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -12 predicate places. [2022-11-02 20:53:14,116 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2022-11-02 20:53:14,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:53:14,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:14,117 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] [2022-11-02 20:53:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:14,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2063316520, now seen corresponding path program 1 times [2022-11-02 20:53:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893907031] [2022-11-02 20:53:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,220 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:53:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893907031] [2022-11-02 20:53:14,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893907031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944507980] [2022-11-02 20:53:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:14,225 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 20:53:14,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:14,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:14,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 20:53:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:14,334 INFO L130 PetriNetUnfolder]: 18/295 cut-off events. [2022-11-02 20:53:14,334 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:53:14,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 295 events. 18/295 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1104 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 342. Up to 23 conditions per place. [2022-11-02 20:53:14,339 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 20:53:14,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 386 flow [2022-11-02 20:53:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 20:53:14,342 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 20:53:14,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 20:53:14,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 20:53:14,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:14,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 20:53:14,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:53:14,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,347 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 504 transitions. [2022-11-02 20:53:14,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 386 flow [2022-11-02 20:53:14,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:14,352 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2022-11-02 20:53:14,353 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2022-11-02 20:53:14,356 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -14 predicate places. [2022-11-02 20:53:14,356 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2022-11-02 20:53:14,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:14,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:14,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:14,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:14,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 940500773, now seen corresponding path program 1 times [2022-11-02 20:53:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064493666] [2022-11-02 20:53:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,445 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:53:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064493666] [2022-11-02 20:53:14,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064493666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567775953] [2022-11-02 20:53:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:14,451 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-02 20:53:14,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:53:14,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:14,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-02 20:53:14,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:14,588 INFO L130 PetriNetUnfolder]: 69/506 cut-off events. [2022-11-02 20:53:14,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:14,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 506 events. 69/506 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2819 event pairs, 50 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 638. Up to 107 conditions per place. [2022-11-02 20:53:14,598 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 20:53:14,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 398 flow [2022-11-02 20:53:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-02 20:53:14,601 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8635578583765112 [2022-11-02 20:53:14,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-02 20:53:14,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-02 20:53:14,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:14,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-02 20:53:14,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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:53:14,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,606 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 500 transitions. [2022-11-02 20:53:14,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 398 flow [2022-11-02 20:53:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 173 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:14,612 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2022-11-02 20:53:14,612 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=171} [2022-11-02 20:53:14,615 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -15 predicate places. [2022-11-02 20:53:14,616 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2022-11-02 20:53:14,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:53:14,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:14,617 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:53:14,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:53:14,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:14,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 193157200, now seen corresponding path program 1 times [2022-11-02 20:53:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842104321] [2022-11-02 20:53:14,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,714 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:53:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842104321] [2022-11-02 20:53:14,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842104321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73299821] [2022-11-02 20:53:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:14,732 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 20:53:14,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:53:14,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:14,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 20:53:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:14,820 INFO L130 PetriNetUnfolder]: 26/228 cut-off events. [2022-11-02 20:53:14,821 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 228 events. 26/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 809 event pairs, 16 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 312. Up to 49 conditions per place. [2022-11-02 20:53:14,825 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-02 20:53:14,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 390 flow [2022-11-02 20:53:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-11-02 20:53:14,828 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2022-11-02 20:53:14,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-11-02 20:53:14,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-11-02 20:53:14,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:14,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-11-02 20:53:14,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:53:14,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:14,835 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 499 transitions. [2022-11-02 20:53:14,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 390 flow [2022-11-02 20:53:14,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:14,840 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2022-11-02 20:53:14,841 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2022-11-02 20:53:14,842 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -16 predicate places. [2022-11-02 20:53:14,842 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2022-11-02 20:53:14,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:53:14,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:14,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, 1, 1, 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:53:14,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:53:14,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1907786638, now seen corresponding path program 1 times [2022-11-02 20:53:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984720641] [2022-11-02 20:53:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,904 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:53:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984720641] [2022-11-02 20:53:14,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984720641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396766330] [2022-11-02 20:53:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:14,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 20:53:14,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:14,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:14,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 20:53:14,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:15,073 INFO L130 PetriNetUnfolder]: 49/471 cut-off events. [2022-11-02 20:53:15,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 471 events. 49/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2365 event pairs, 22 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 561. Up to 51 conditions per place. [2022-11-02 20:53:15,083 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-11-02 20:53:15,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2022-11-02 20:53:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-02 20:53:15,086 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-02 20:53:15,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-02 20:53:15,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-02 20:53:15,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:15,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-02 20:53:15,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:53:15,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,092 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 505 transitions. [2022-11-02 20:53:15,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2022-11-02 20:53:15,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:15,097 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2022-11-02 20:53:15,098 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2022-11-02 20:53:15,101 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-02 20:53:15,101 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2022-11-02 20:53:15,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:15,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:15,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:53:15,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 430849023, now seen corresponding path program 1 times [2022-11-02 20:53:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842491437] [2022-11-02 20:53:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842491437] [2022-11-02 20:53:15,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842491437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451726156] [2022-11-02 20:53:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:15,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-02 20:53:15,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:53:15,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:15,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-02 20:53:15,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:15,353 INFO L130 PetriNetUnfolder]: 41/615 cut-off events. [2022-11-02 20:53:15,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:15,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 615 events. 41/615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2895 event pairs, 14 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 704. Up to 37 conditions per place. [2022-11-02 20:53:15,362 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 20:53:15,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 388 flow [2022-11-02 20:53:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-11-02 20:53:15,365 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9015544041450777 [2022-11-02 20:53:15,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-11-02 20:53:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-11-02 20:53:15,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:15,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-11-02 20:53:15,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 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:53:15,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,370 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 522 transitions. [2022-11-02 20:53:15,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 388 flow [2022-11-02 20:53:15,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 173 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:15,376 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 352 flow [2022-11-02 20:53:15,376 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2022-11-02 20:53:15,377 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -17 predicate places. [2022-11-02 20:53:15,378 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 352 flow [2022-11-02 20:53:15,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:53:15,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:15,379 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] [2022-11-02 20:53:15,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:53:15,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 430848325, now seen corresponding path program 1 times [2022-11-02 20:53:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885579825] [2022-11-02 20:53:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,452 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:53:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885579825] [2022-11-02 20:53:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885579825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646820532] [2022-11-02 20:53:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:15,463 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 20:53:15,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 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:53:15,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:15,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 20:53:15,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:15,654 INFO L130 PetriNetUnfolder]: 81/659 cut-off events. [2022-11-02 20:53:15,654 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:53:15,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 659 events. 81/659 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3234 event pairs, 26 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 808. Up to 71 conditions per place. [2022-11-02 20:53:15,662 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 3 changer transitions 0/169 dead transitions. [2022-11-02 20:53:15,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 382 flow [2022-11-02 20:53:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 20:53:15,665 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 20:53:15,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:15,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:53:15,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,670 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 352 flow. Second operand 3 states and 512 transitions. [2022-11-02 20:53:15,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 382 flow [2022-11-02 20:53:15,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:15,675 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 352 flow [2022-11-02 20:53:15,675 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2022-11-02 20:53:15,676 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-02 20:53:15,676 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 352 flow [2022-11-02 20:53:15,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 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:53:15,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:15,677 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] [2022-11-02 20:53:15,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:53:15,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1728395284, now seen corresponding path program 1 times [2022-11-02 20:53:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932819835] [2022-11-02 20:53:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,718 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:53:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932819835] [2022-11-02 20:53:15,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932819835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787857623] [2022-11-02 20:53:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:15,722 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 20:53:15,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 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:53:15,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:15,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 20:53:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:15,856 INFO L130 PetriNetUnfolder]: 89/647 cut-off events. [2022-11-02 20:53:15,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 647 events. 89/647 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3245 event pairs, 26 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 826. Up to 72 conditions per place. [2022-11-02 20:53:15,865 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2022-11-02 20:53:15,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 382 flow [2022-11-02 20:53:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 20:53:15,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 20:53:15,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:15,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 20:53:15,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:53:15,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:15,873 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 352 flow. Second operand 3 states and 512 transitions. [2022-11-02 20:53:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 167 transitions, 382 flow [2022-11-02 20:53:15,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:15,878 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 346 flow [2022-11-02 20:53:15,879 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2022-11-02 20:53:15,879 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-02 20:53:15,880 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 346 flow [2022-11-02 20:53:15,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 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:53:15,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:15,881 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] [2022-11-02 20:53:15,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:15,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash -215926811, now seen corresponding path program 1 times [2022-11-02 20:53:15,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053834091] [2022-11-02 20:53:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,922 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:53:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053834091] [2022-11-02 20:53:15,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053834091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558527959] [2022-11-02 20:53:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:15,926 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 20:53:15,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:15,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:15,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 20:53:15,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:16,023 INFO L130 PetriNetUnfolder]: 18/346 cut-off events. [2022-11-02 20:53:16,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:16,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 346 events. 18/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1007 event pairs, 9 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 406. Up to 34 conditions per place. [2022-11-02 20:53:16,029 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 20:53:16,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 165 transitions, 380 flow [2022-11-02 20:53:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-02 20:53:16,032 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8601036269430051 [2022-11-02 20:53:16,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-02 20:53:16,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-02 20:53:16,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:16,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-02 20:53:16,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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:53:16,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,037 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 346 flow. Second operand 3 states and 498 transitions. [2022-11-02 20:53:16,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 165 transitions, 380 flow [2022-11-02 20:53:16,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 165 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:16,041 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 344 flow [2022-11-02 20:53:16,042 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2022-11-02 20:53:16,042 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -21 predicate places. [2022-11-02 20:53:16,043 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 344 flow [2022-11-02 20:53:16,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:53:16,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:16,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:16,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:16,044 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1939820954, now seen corresponding path program 1 times [2022-11-02 20:53:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914591340] [2022-11-02 20:53:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,085 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:53:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914591340] [2022-11-02 20:53:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914591340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71305624] [2022-11-02 20:53:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:16,089 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 20:53:16,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 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:53:16,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:16,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 20:53:16,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:16,234 INFO L130 PetriNetUnfolder]: 73/611 cut-off events. [2022-11-02 20:53:16,235 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:16,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 611 events. 73/611 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3042 event pairs, 46 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 764. Up to 99 conditions per place. [2022-11-02 20:53:16,242 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 20:53:16,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 378 flow [2022-11-02 20:53:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 20:53:16,245 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 20:53:16,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 20:53:16,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 20:53:16,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:16,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 20:53:16,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:53:16,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,250 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 344 flow. Second operand 3 states and 512 transitions. [2022-11-02 20:53:16,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 378 flow [2022-11-02 20:53:16,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:16,255 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 342 flow [2022-11-02 20:53:16,255 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2022-11-02 20:53:16,256 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-02 20:53:16,256 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 342 flow [2022-11-02 20:53:16,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 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:53:16,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:16,257 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] [2022-11-02 20:53:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:53:16,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -596713196, now seen corresponding path program 1 times [2022-11-02 20:53:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137828750] [2022-11-02 20:53:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,300 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:53:16,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137828750] [2022-11-02 20:53:16,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137828750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042697851] [2022-11-02 20:53:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:16,304 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 20:53:16,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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:53:16,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:16,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 20:53:16,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:16,433 INFO L130 PetriNetUnfolder]: 73/603 cut-off events. [2022-11-02 20:53:16,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 603 events. 73/603 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2983 event pairs, 46 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 768. Up to 99 conditions per place. [2022-11-02 20:53:16,441 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-02 20:53:16,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 378 flow [2022-11-02 20:53:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 20:53:16,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 20:53:16,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:16,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:53:16,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,449 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 342 flow. Second operand 3 states and 504 transitions. [2022-11-02 20:53:16,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 378 flow [2022-11-02 20:53:16,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:16,454 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2022-11-02 20:53:16,455 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-02 20:53:16,455 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 20:53:16,455 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2022-11-02 20:53:16,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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:53:16,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:16,456 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] [2022-11-02 20:53:16,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:53:16,457 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash 187265853, now seen corresponding path program 1 times [2022-11-02 20:53:16,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793999429] [2022-11-02 20:53:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,501 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:53:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793999429] [2022-11-02 20:53:16,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793999429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577622419] [2022-11-02 20:53:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:16,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:16,505 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-02 20:53:16,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:53:16,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:16,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-02 20:53:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:16,657 INFO L130 PetriNetUnfolder]: 61/583 cut-off events. [2022-11-02 20:53:16,657 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:16,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 583 events. 61/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2567 event pairs, 18 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 708. Up to 51 conditions per place. [2022-11-02 20:53:16,664 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-02 20:53:16,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2022-11-02 20:53:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-02 20:53:16,667 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8946459412780656 [2022-11-02 20:53:16,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-02 20:53:16,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-02 20:53:16,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:16,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-02 20:53:16,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:53:16,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,672 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 518 transitions. [2022-11-02 20:53:16,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2022-11-02 20:53:16,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:16,677 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 344 flow [2022-11-02 20:53:16,677 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-02 20:53:16,678 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 20:53:16,678 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 344 flow [2022-11-02 20:53:16,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:53:16,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:16,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:16,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:53:16,680 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1490312150, now seen corresponding path program 1 times [2022-11-02 20:53:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505457385] [2022-11-02 20:53:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,724 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:53:16,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505457385] [2022-11-02 20:53:16,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505457385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614184183] [2022-11-02 20:53:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:16,728 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 20:53:16,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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:53:16,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:16,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 20:53:16,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:16,856 INFO L130 PetriNetUnfolder]: 81/595 cut-off events. [2022-11-02 20:53:16,856 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-02 20:53:16,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 595 events. 81/595 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3002 event pairs, 54 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 780. Up to 115 conditions per place. [2022-11-02 20:53:16,863 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-11-02 20:53:16,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 380 flow [2022-11-02 20:53:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 20:53:16,866 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 20:53:16,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:16,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 20:53:16,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:53:16,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:16,870 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 344 flow. Second operand 3 states and 504 transitions. [2022-11-02 20:53:16,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 380 flow [2022-11-02 20:53:16,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 163 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:16,875 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 344 flow [2022-11-02 20:53:16,875 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2022-11-02 20:53:16,876 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 20:53:16,876 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 344 flow [2022-11-02 20:53:16,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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:53:16,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:16,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:16,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:53:16,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash -91697017, now seen corresponding path program 1 times [2022-11-02 20:53:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788851720] [2022-11-02 20:53:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,934 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:53:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788851720] [2022-11-02 20:53:16,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788851720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864745160] [2022-11-02 20:53:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:16,938 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-02 20:53:16,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:53:16,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:16,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-02 20:53:16,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:17,063 INFO L130 PetriNetUnfolder]: 73/583 cut-off events. [2022-11-02 20:53:17,064 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 583 events. 73/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2766 event pairs, 54 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 764. Up to 115 conditions per place. [2022-11-02 20:53:17,087 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2022-11-02 20:53:17,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 384 flow [2022-11-02 20:53:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-02 20:53:17,090 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2022-11-02 20:53:17,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-02 20:53:17,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-02 20:53:17,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:17,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-02 20:53:17,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 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:53:17,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:17,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:17,095 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 344 flow. Second operand 3 states and 497 transitions. [2022-11-02 20:53:17,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 384 flow [2022-11-02 20:53:17,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:17,101 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 342 flow [2022-11-02 20:53:17,101 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-11-02 20:53:17,102 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-02 20:53:17,102 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 342 flow [2022-11-02 20:53:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:53:17,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:17,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:17,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:53:17,104 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:17,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1186677298, now seen corresponding path program 1 times [2022-11-02 20:53:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:17,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876342175] [2022-11-02 20:53:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876342175] [2022-11-02 20:53:17,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876342175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:17,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704191017] [2022-11-02 20:53:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:17,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:17,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:53:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:53:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:17,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:17,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704191017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:17,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:17,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-02 20:53:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887929289] [2022-11-02 20:53:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:17,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:17,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:17,477 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-02 20:53:17,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:17,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:17,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-02 20:53:17,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:17,588 INFO L130 PetriNetUnfolder]: 36/496 cut-off events. [2022-11-02 20:53:17,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:17,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 496 events. 36/496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1860 event pairs, 1 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 574. Up to 31 conditions per place. [2022-11-02 20:53:17,595 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-11-02 20:53:17,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-02 20:53:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-02 20:53:17,598 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9101899827288429 [2022-11-02 20:53:17,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-02 20:53:17,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-02 20:53:17,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:17,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-02 20:53:17,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 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:53:17,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:17,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:17,604 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 342 flow. Second operand 3 states and 527 transitions. [2022-11-02 20:53:17,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-02 20:53:17,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:17,609 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 372 flow [2022-11-02 20:53:17,609 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-02 20:53:17,610 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-02 20:53:17,610 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 372 flow [2022-11-02 20:53:17,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:17,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:17,611 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:17,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:17,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:53:17,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -359410964, now seen corresponding path program 1 times [2022-11-02 20:53:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032830857] [2022-11-02 20:53:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032830857] [2022-11-02 20:53:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032830857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661766959] [2022-11-02 20:53:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:18,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:18,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:53:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:53:18,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:18,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661766959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:18,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:18,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-02 20:53:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240186441] [2022-11-02 20:53:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:18,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:18,178 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-02 20:53:18,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:18,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:18,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-02 20:53:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:18,327 INFO L130 PetriNetUnfolder]: 78/616 cut-off events. [2022-11-02 20:53:18,327 INFO L131 PetriNetUnfolder]: For 138/151 co-relation queries the response was YES. [2022-11-02 20:53:18,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 616 events. 78/616 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2799 event pairs, 0 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 880. Up to 59 conditions per place. [2022-11-02 20:53:18,335 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-02 20:53:18,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 436 flow [2022-11-02 20:53:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-11-02 20:53:18,338 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9119170984455959 [2022-11-02 20:53:18,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-11-02 20:53:18,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-11-02 20:53:18,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:18,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-11-02 20:53:18,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:53:18,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:18,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:53:18,343 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 372 flow. Second operand 3 states and 528 transitions. [2022-11-02 20:53:18,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 436 flow [2022-11-02 20:53:18,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:18,348 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 422 flow [2022-11-02 20:53:18,349 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2022-11-02 20:53:18,349 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-02 20:53:18,350 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 422 flow [2022-11-02 20:53:18,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:18,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:18,351 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:18,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:18,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:18,567 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:18,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash -598637021, now seen corresponding path program 1 times [2022-11-02 20:53:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696507992] [2022-11-02 20:53:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:18,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696507992] [2022-11-02 20:53:18,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696507992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:18,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900161127] [2022-11-02 20:53:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:18,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:18,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:53:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:53:18,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:19,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:19,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900161127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:19,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:19,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 20:53:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899852180] [2022-11-02 20:53:19,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:19,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:53:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:53:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:19,114 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 20:53:19,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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:53:19,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:19,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 20:53:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:19,523 INFO L130 PetriNetUnfolder]: 232/1316 cut-off events. [2022-11-02 20:53:19,524 INFO L131 PetriNetUnfolder]: For 997/1025 co-relation queries the response was YES. [2022-11-02 20:53:19,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1316 events. 232/1316 cut-off events. For 997/1025 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6537 event pairs, 13 based on Foata normal form. 16/1275 useless extension candidates. Maximal degree in co-relation 2312. Up to 133 conditions per place. [2022-11-02 20:53:19,545 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 62 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-02 20:53:19,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 220 transitions, 876 flow [2022-11-02 20:53:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:53:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2022-11-02 20:53:19,550 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2022-11-02 20:53:19,550 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2022-11-02 20:53:19,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2022-11-02 20:53:19,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:19,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2022-11-02 20:53:19,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.33333333333334) internal successors, (1533), 9 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:53:19,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 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:53:19,570 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 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:53:19,578 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 422 flow. Second operand 9 states and 1533 transitions. [2022-11-02 20:53:19,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 220 transitions, 876 flow [2022-11-02 20:53:19,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 220 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:19,585 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 460 flow [2022-11-02 20:53:19,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2022-11-02 20:53:19,588 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-02 20:53:19,588 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 460 flow [2022-11-02 20:53:19,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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:53:19,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:19,590 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:19,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:19,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:19,815 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 327415809, now seen corresponding path program 2 times [2022-11-02 20:53:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745978766] [2022-11-02 20:53:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:20,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745978766] [2022-11-02 20:53:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745978766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923618176] [2022-11-02 20:53:20,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:53:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:20,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:20,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:53:20,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:53:20,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:20,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:53:20,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:20,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:20,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923618176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:20,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:20,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 20:53:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476869671] [2022-11-02 20:53:20,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:20,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:53:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:53:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:53:20,824 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 20:53:20,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 460 flow. Second operand has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 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:53:20,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:20,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 20:53:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:21,803 INFO L130 PetriNetUnfolder]: 392/2176 cut-off events. [2022-11-02 20:53:21,804 INFO L131 PetriNetUnfolder]: For 1508/1536 co-relation queries the response was YES. [2022-11-02 20:53:21,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 2176 events. 392/2176 cut-off events. For 1508/1536 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10489 event pairs, 13 based on Foata normal form. 26/2143 useless extension candidates. Maximal degree in co-relation 3882. Up to 213 conditions per place. [2022-11-02 20:53:21,833 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 138 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2022-11-02 20:53:21,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1558 flow [2022-11-02 20:53:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:53:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:53:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3567 transitions. [2022-11-02 20:53:21,841 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8800888230940045 [2022-11-02 20:53:21,842 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3567 transitions. [2022-11-02 20:53:21,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3567 transitions. [2022-11-02 20:53:21,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:21,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3567 transitions. [2022-11-02 20:53:21,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 169.85714285714286) internal successors, (3567), 21 states have internal predecessors, (3567), 0 states have call successors, (0), 0 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:53:21,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 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:53:21,863 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 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:53:21,864 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 460 flow. Second operand 21 states and 3567 transitions. [2022-11-02 20:53:21,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 308 transitions, 1558 flow [2022-11-02 20:53:21,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 308 transitions, 1544 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:21,873 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 584 flow [2022-11-02 20:53:21,874 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=584, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2022-11-02 20:53:21,874 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2022-11-02 20:53:21,874 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 584 flow [2022-11-02 20:53:21,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 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:53:21,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:21,876 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:21,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:22,103 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1096529341, now seen corresponding path program 3 times [2022-11-02 20:53:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:22,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669241900] [2022-11-02 20:53:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669241900] [2022-11-02 20:53:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669241900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:22,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423246430] [2022-11-02 20:53:22,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:53:22,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:22,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:22,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:22,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:53:23,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-02 20:53:23,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:23,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:53:23,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:23,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423246430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:24,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:24,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-02 20:53:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846907961] [2022-11-02 20:53:24,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:53:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:53:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:53:24,398 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 20:53:24,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 584 flow. Second operand has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 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:53:24,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:24,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 20:53:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:26,800 INFO L130 PetriNetUnfolder]: 712/3896 cut-off events. [2022-11-02 20:53:26,800 INFO L131 PetriNetUnfolder]: For 4546/4574 co-relation queries the response was YES. [2022-11-02 20:53:26,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 3896 events. 712/3896 cut-off events. For 4546/4574 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 18429 event pairs, 13 based on Foata normal form. 46/3883 useless extension candidates. Maximal degree in co-relation 7428. Up to 373 conditions per place. [2022-11-02 20:53:26,859 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 290 selfloop transitions, 45 changer transitions 0/484 dead transitions. [2022-11-02 20:53:26,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 484 transitions, 3090 flow [2022-11-02 20:53:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 20:53:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-02 20:53:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7635 transitions. [2022-11-02 20:53:26,873 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2022-11-02 20:53:26,873 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7635 transitions. [2022-11-02 20:53:26,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7635 transitions. [2022-11-02 20:53:26,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:26,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7635 transitions. [2022-11-02 20:53:26,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 169.66666666666666) internal successors, (7635), 45 states have internal predecessors, (7635), 0 states have call successors, (0), 0 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:53:26,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 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:53:26,914 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 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:53:26,914 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 584 flow. Second operand 45 states and 7635 transitions. [2022-11-02 20:53:26,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 484 transitions, 3090 flow [2022-11-02 20:53:26,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 484 transitions, 3050 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-02 20:53:26,929 INFO L231 Difference]: Finished difference. Result has 250 places, 214 transitions, 862 flow [2022-11-02 20:53:26,930 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=862, PETRI_PLACES=250, PETRI_TRANSITIONS=214} [2022-11-02 20:53:26,930 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 60 predicate places. [2022-11-02 20:53:26,931 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 214 transitions, 862 flow [2022-11-02 20:53:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 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:53:26,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:26,934 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:26,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:27,147 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1622679613, now seen corresponding path program 4 times [2022-11-02 20:53:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:27,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368851100] [2022-11-02 20:53:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368851100] [2022-11-02 20:53:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368851100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057895256] [2022-11-02 20:53:29,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:53:29,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:29,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:29,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:29,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:53:30,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:53:30,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:30,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:53:30,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:31,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:32,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057895256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:32,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:32,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35 [2022-11-02 20:53:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864242490] [2022-11-02 20:53:32,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:32,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:53:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:53:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:53:32,384 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 20:53:32,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 214 transitions, 862 flow. Second operand has 35 states, 35 states have (on average 168.0857142857143) internal successors, (5883), 35 states have internal predecessors, (5883), 0 states have call successors, (0), 0 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:53:32,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:32,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 20:53:32,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:34,972 INFO L130 PetriNetUnfolder]: 752/4111 cut-off events. [2022-11-02 20:53:34,972 INFO L131 PetriNetUnfolder]: For 5345/5373 co-relation queries the response was YES. [2022-11-02 20:53:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8163 conditions, 4111 events. 752/4111 cut-off events. For 5345/5373 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 19669 event pairs, 13 based on Foata normal form. 11/4063 useless extension candidates. Maximal degree in co-relation 8139. Up to 393 conditions per place. [2022-11-02 20:53:35,044 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 309 selfloop transitions, 48 changer transitions 0/506 dead transitions. [2022-11-02 20:53:35,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 506 transitions, 3390 flow [2022-11-02 20:53:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:53:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-11-02 20:53:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 8136 transitions. [2022-11-02 20:53:35,056 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8782383419689119 [2022-11-02 20:53:35,056 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 8136 transitions. [2022-11-02 20:53:35,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 8136 transitions. [2022-11-02 20:53:35,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:35,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 8136 transitions. [2022-11-02 20:53:35,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 169.5) internal successors, (8136), 48 states have internal predecessors, (8136), 0 states have call successors, (0), 0 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:53:35,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 193.0) internal successors, (9457), 49 states have internal predecessors, (9457), 0 states have call successors, (0), 0 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:53:35,178 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 193.0) internal successors, (9457), 49 states have internal predecessors, (9457), 0 states have call successors, (0), 0 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:53:35,178 INFO L175 Difference]: Start difference. First operand has 250 places, 214 transitions, 862 flow. Second operand 48 states and 8136 transitions. [2022-11-02 20:53:35,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 506 transitions, 3390 flow [2022-11-02 20:53:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 506 transitions, 3332 flow, removed 11 selfloop flow, removed 18 redundant places. [2022-11-02 20:53:35,201 INFO L231 Difference]: Finished difference. Result has 283 places, 218 transitions, 960 flow [2022-11-02 20:53:35,201 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=960, PETRI_PLACES=283, PETRI_TRANSITIONS=218} [2022-11-02 20:53:35,202 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 93 predicate places. [2022-11-02 20:53:35,202 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 218 transitions, 960 flow [2022-11-02 20:53:35,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.0857142857143) internal successors, (5883), 35 states have internal predecessors, (5883), 0 states have call successors, (0), 0 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:53:35,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:35,205 INFO L208 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:35,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:53:35,431 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-02 20:53:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 993345884, now seen corresponding path program 5 times [2022-11-02 20:53:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:35,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690071780] [2022-11-02 20:53:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:35,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:53:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:35,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:53:35,836 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:53:35,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-02 20:53:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-02 20:53:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-02 20:53:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-02 20:53:35,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-02 20:53:35,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-02 20:53:35,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-02 20:53:35,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-02 20:53:35,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-02 20:53:35,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-02 20:53:35,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-02 20:53:35,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-02 20:53:35,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-02 20:53:35,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-02 20:53:35,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-02 20:53:35,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-02 20:53:35,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-02 20:53:35,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-02 20:53:35,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-02 20:53:35,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-02 20:53:35,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-02 20:53:35,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-02 20:53:35,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-02 20:53:35,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-02 20:53:35,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-02 20:53:35,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-02 20:53:35,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-02 20:53:35,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-02 20:53:35,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-02 20:53:35,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-02 20:53:35,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-02 20:53:35,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-02 20:53:35,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-02 20:53:35,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-02 20:53:35,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-02 20:53:35,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-02 20:53:35,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:53:35,848 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:35,856 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:53:35,856 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:53:36,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:53:36 BasicIcfg [2022-11-02 20:53:36,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:53:36,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:53:36,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:53:36,196 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:53:36,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12" (3/4) ... [2022-11-02 20:53:36,200 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:53:36,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:53:36,201 INFO L158 Benchmark]: Toolchain (without parser) took 25753.06ms. Allocated memory was 104.9MB in the beginning and 465.6MB in the end (delta: 360.7MB). Free memory was 72.6MB in the beginning and 127.2MB in the end (delta: -54.6MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,201 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:36,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.55ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: -49.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.73ms. Allocated memory is still 104.9MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,202 INFO L158 Benchmark]: Boogie Preprocessor took 67.34ms. Allocated memory is still 104.9MB. Free memory was 70.0MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,203 INFO L158 Benchmark]: RCFGBuilder took 850.38ms. Allocated memory is still 104.9MB. Free memory was 68.2MB in the beginning and 47.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,203 INFO L158 Benchmark]: TraceAbstraction took 24051.78ms. Allocated memory was 144.7MB in the beginning and 465.6MB in the end (delta: 320.9MB). Free memory was 120.8MB in the beginning and 127.2MB in the end (delta: -6.4MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. [2022-11-02 20:53:36,203 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 465.6MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:36,205 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.34ms. Allocated memory is still 104.9MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.55ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: -49.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.73ms. Allocated memory is still 104.9MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.34ms. Allocated memory is still 104.9MB. Free memory was 70.0MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 850.38ms. Allocated memory is still 104.9MB. Free memory was 68.2MB in the beginning and 47.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24051.78ms. Allocated memory was 144.7MB in the beginning and 465.6MB in the end (delta: 320.9MB). Free memory was 120.8MB in the beginning and 127.2MB in the end (delta: -6.4MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 465.6MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=1656, argc=1656, argv={1644:1600}, argv={1644:1600}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=1656, argc=1656, argv={1644:1600}, argv={1644:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=1656, argc=1656, argv={1644:1600}, argv={1644:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=1656, arg={0:0}, argc=1656, argv={1644:1600}, argv={1644:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=1656, arg={0:0}, arg={0:0}, argc=1656, argv={1644:1600}, argv={1644:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 16 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND FALSE 0 !(x < 16) VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L711] 0 return prev; VAL [\result=987, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=1656, arg={0:0}, arg={0:0}, argc=1656, argv={1644:1600}, argv={1644:1600}, correct=987, cur=1597, fib()=987, i=1, id1={5:0}, id2={3:0}, j=1, next=1597, p=0, prev=987, q=0, x=16] [L725] 0 i <= correct VAL [\old(argc)=1656, arg={0:0}, arg={0:0}, argc=1656, argv={1644:1600}, argv={1644:1600}, correct=987, cur=1597, i=1, id1={5:0}, id2={3:0}, j=1, next=1597, p=0, prev=987, q=0, x=16] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L688] 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L688] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=2, j=1, next=1597, p=0, prev=987, q=0, x=16] [L725] 0 i <= correct VAL [\old(argc)=1656, arg={0:0}, arg={0:0}, arg={0:0}, argc=1656, argv={1644:1600}, argv={1644:1600}, correct=987, cur=1597, i=2, id1={5:0}, id2={3:0}, j=1, next=1597, p=0, prev=987, q=0, x=16] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: 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: 707]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: 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: 722]: 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: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: 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: 698]: 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: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 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: 23.5s, OverallIterations: 24, TraceHistogramMax: 17, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1034 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 407 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 152 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2756 GetRequests, 2538 SyntacticMatches, 31 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2620 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=23, InterpolantAutomatonStates: 179, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 4314 NumberOfCodeBlocks, 4314 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4844 ConstructedInterpolants, 0 QuantifiedInterpolants, 10688 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2700 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 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:53:36,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec35451-9c8e-4d21-9854-53704aed4877/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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